1. Lecture 2 Chapter 10 continued…

2. Last Lecture Summary: Covered Sec. 10.1 and most part of Sec. 10.2. Basic concepts of Linear Programming Problem and it’s Modelling. Graphical Solution of Inequalities. Graphical Solutions of LP problem. Solutions using corner-point method.

3. Today’s Main Topics Continue with Sec. 10.2 and cover 10.3. Alternative Optimal Solutions No Feasible Solution and Unbounded Solution Scenarios Applications of Linear Programming: – Diet Mix Model – Highway Maintenance (Transportation Model)

4. Alternative Optimal Solutions An optimal solution will always occur at a corner point of feasible region. There’s a possibly of more than one optimal solutions in LP problem. Two Conditions: The objective function must be parallel to the constraint which forms as edge or boundary on the feasible region The constraint must form a boundary on the feasible region in the direction of optimal movement of the objective function

5. Example 7 (on page 437 of Budnick): Use corner-point method to solve: Maximize z = 20x 1 + 15x 2 Subject to3x 1 + 4x 2 ≤ 60(1) 4x 1 + 3x 2 ≤ 60(2) x 1 ≤ 10(3) x 2 ≤ 12(4) x 1, x 2 ≥ 0(5)

6. A (1) (4) (3) (2) C Z = 260 B Z = 180 A z = 0 F Z = 200 E Z = 300 D Z = 300

7. Optimal Solution at D and E. In fact, any point along the line DE will give this optimal solution. REASON Both the conditions for alternative optimal solutions were satisfied in this example. The objective function was parallel to the constraint (2) and the constraint (2) was a boundary line in the direction of the optimal movement of objective function.

8. No Feasible Solutions The system of constraints in an LP problem may have NO points which satisfy all constraints. In such cases, there are no points in the solution set and hence the LP problem is said to have no feasible solution.

9. Unbounded Solutions

10. Applications of Linear Programming Diet Mix Model The classical diet mix problem involves determining the items which should be included in the meal so as to Minimize the cost of the meal while Satisfying certain nutritional requirements Let’s see an example...

11. Example 8 (pg. 442) A dietician is planning the menu for the evening meal at a university dining hall. Three main items will be served, all having different nutritional content. The dietician is interested in providing at least the minimum daily requirement of each of three vitamins in this one meal. Following table summarizes the vitamin contents per ounce of each type of food, the cost per ounce of each food, and minimum daily requirements (MDR) for the three vitamins. Any combination of the three foods may be selected as long as the total serving size is at least 9 ounces.

12. Diet Mix Example Cont’d... Vitamins Food 123Cost per Oz, $ 150mg20mg10mg0.10 230mg10mg50mg0.15 320mg30mg20mg0.12 Minimum daily requirement (MDR)290mg200mg210mg

13. The problem is to determine the number of ounces of each food to be included in the meal. The objective is to minimize the cost of each meal subject to satisfying minimum daily requirements of the three vitamins as well as the restriction on minimum serving size.

14. Formulation Let x j equal the number of ounces included of food j. The objective function should represent the total cost of the meal. Stated in dollars, the total cost equals the sum of the costs of the three items, or Z = 0.10x 1 + 0.15x 2 + 0.12x 3

15. The constraint for each vitamin will have the form. Milligrams of vitamin intake ≥ MDR OR Milligrams from food 1 + milligram from food 2+ milligram from food 3 ≥ MDR

16. The constraints are, respectively, 50x 1 + 30x 2 + 20x 3 ≥ 290(vitamin 1) 20x 1 + 10x 2 + 30x 3 ≥ 200 (vitamin 2) 10x 1 + 50x 2 + 20x 3 ≥ 210 (vitamin 3) The restriction that the serving size be at least 9 ounces is stated as x1 + x2 + x3 ≥ 9(minimum serving size)

17. Diet Mix Example Cont’d... The complete formulation of the problem is as follows: Minimizez = 0.10x 1 + 0.15x 2 + 0.12x 3 subject to50x 1 + 30x 2 + 20x 3 ≥ 290 20x 1 + 10x 2 + 30x 3 ≥ 200 10x 1 + 50x 2 + 20x 3 ≥ 210 x 1 + x 2 + x 3 ≥ 9 x 1, x 2, x 3 ≥ 0

18. Transportation Model Transportation models are possibly the most widely used linear programming models. Oil companies commit tremendous resources to the implementation of such models. The classic example of a transportation problem involves the shipment of some homogeneous commodity from m sources of supply, or origins, to n points of demand, or destinations. By homogeneous we mean that there are no significant differences in the quality of the item provided by the different sources of supply. The item characteristics are essentially the same.

19. Example (Highway Maintenance) A medium-size city has two locations in the city at which salt and sand stockpiles are maintained for use during winter icing and snowstorms. During a storm, salt and sand are distributed from these two locations to four different city zones. Occasionally additional salt and sand are needed. However, it is usually impossible to get additional supplies during a storm since they are stockpiled at a central location some distance outside the city. City officials hope that there will not be back-to-back storms.

20. The director of public works is interested in determining the minimum cost of allocating salt and sand supplies during a storm. Following table summarizes the cost of supplying 1 ton of salt or sand from each stockpile to each city zone. In addition, stockpile capacities and normal levels of demand for each zone are indicated (in tons)

21. Zone 1234Maximum Supply, Tons Stockpile 1$2.00$3.00$1.50$2.50900 Stockpile 24.003.502.503.00750 Demand, tons300450500350

22. In formulating the linear programming model for this problem, there are eight decisions to make- how many tons should be shipped from each stockpile to each zone. Let x ij equal the number of tons supplied from stockpile i to zone j. For example, x 11 equals the number of tons supplied by stockpile 1 to zone 1. Similarly, x 23 equals the number of tons supplied by stockpile 2 to zone 3. This double-subscripted variable conveys more information than the variables x 1, x 2, ……… x 8.

23. Give this definition of the decision variables, the total cost of distributing salt and sand has the form: Total Cost = 2x 11 + 3x 12 + 1.5x 13 + 2.5x 14 + 4x 11 + 3.5x 22 +2.5x 23 +3x 24 This is the objective function that we wish to minimize.

24. For stockpile 1, the sum of the shipments to all zones cannot exceed 900 tons, or x 11 + x 12 + x 13 + x 14 ≤ 900 (stockpile 1) The same constraint for stockpile 2 is x 21 + x 22 + x 23 + x 24 ≤ 750 (stockpile 2)

25. The final class of constraints should guarantee that each zone receives the quantity demanded. For zone 1, the sum of the shipments from stockpiles 1 and 2 should equal 300 tons, or x 11 + x 21 = 300 (zone 1) The same constraints for the other three zones are, respectively, x 12 + x 22 = 450 (zone 2) x 13 + x 23 = 500 (zone 3) x 14 + x 24 = 350 (zone 4)

26. The complete formulation of the linear programming model is as follows: Minimizez = 2x 11 + 3x 12 + 1.5x 13 + 2.5x 14 + 4x 11 + 3.5x 22 +2.5x 23 +3x 24 Subject to x 11 + x 12 + x 13 + x 14 ≤ 900 x 21 + x 22 + x 23 + x 24 ≤ 750 x 11 + x 21 = 300 x 12 + x 22 = 450 x 13 + x 23 = 500 x 14 + x 24 = 350 x 11, x 12, x 13, x 14, x 11, x 22, x 23, x 24 ≥ 0

27. REVIEW Covered Sec. 10.2 and Sec. 10.3 Alternative optimal solution. No feasible solution. Unbounded solution. Applications of linear programming. Diet mix model and transportation model. Next time, we will start Chapter 11.