Author David Graser, Yavapai College, Prescott, AZ (David_Graser@yc.edu)
Abstract
This problem results in a standard minimization problem. Using the daily capacities at three breweries for several types of beers, students construct constraints for to ensure certain amounts of beers are produced.
- Content Area – Finite Math
- Time Frame – 2 to 3 weeks with mini-lectures
- Published – December 8, 2009
- Keywords – linear programming
Project Content
Scaffolding Resources
None
Notes
- The constant L allows for many different projects.