Students will study how linear programming can be used to find the most probable outcome of a situation. Students will study a branching and bounding algorithm that can be used when integer solutions are desired, but not obtained.
Before the Activity
Download the attached PDF and look over the Teacher Page.
During the Activity
Discuss the materials from the Student Page with your class.
After the Activity
Encourage students to explore web sites and questions from the Extensions page.