-
Computer Mix, a classic example of linear programming problem, where products with different margins are made with common resources.
-
Paint production is a simple example that illustrates how resource requirements and production requirements drive the optimal production of different types of paints.
-
Employee scheduling is a classic covering business problem, where staffing requirement must be met.
-
Bus route assignment illustrates how to match bus companies with different school routes so all schools are covered with minimum operating cost.
-
Tomato shipping example illustrates how to minimize transportation cost over a logistic network with source, transit, and destination nodes.
-
Machine maintenance is a classic example of how to convert a multiperiod business problem into a network flow problem.
-
Carrier selection illustrates how to select various logistic providers to satisfy transportation requirements to different destinations.
-
Paper cutting is a classic integer programming model where a stock paper is cut into different widths to satisfy varying demand.
-
NFL team rating illustrates an non-linear programming model where the ratings are set to minimize game match prediction errors.
-
Pricing candy illustrates an non-linear, mixed-integer programming model where the price is set to maximize profit from four customer segments.
-
Pricing candy illustrates an non-linear, mixed-integer programming model where an entry price and a unit price are set to maximize profit from four customer segments.