INDR 262 Introduction to Optimization Methods Midterm I Exercise Set 28.03.2011 1) Giapettos Woodcarving Inc.

manufactures two types of wooden toys: soldier and trains. A soldier sells for $27 and uses $10 worth of raw materials. Each solider that is manufactured increases Giapettos variable labour and overhead costs by $14. A train sells for $2 1 and uses $9 worth of raw material. Each train built increases Giapettos variable labour and overhead costs by $10. The manufacture of wooden soldiers and trains requires two types of skilled labour: carpentry and finishing. A soldier requires 2 hours of finishing labour and 1 hour of carpentry labour. A train requires 1 hour of finishing and 1 hour of carpentry labour. Each week, Giapetto can obtain all the needed raw material but only 100 finishing hours and 80 carpentry hours. Demand for trains is unlimited but at most 40 soldiers are bought each week. Formulate a mathematical method of Giapettos situation that can be used to maximize Giapetteos weekly profit. 2) (Exercise 3.4.9. from [1]) Ralph Edmund loves steaks and potatoes. Therefore, he has decided to go on a steady diet of only these two foods for all his meals. Ralph realizes that this isnt the healthiest diet, so he wants to make sure that he eats the right quantities of the two foods to satisfy some key nutritional requirements. He has obtained the following nutritional and cost information:

Ralph wishes to determine the number of daily servings (may be fractional) of steak and potatoes that will meet these requirements at a minimum cost. (a) Formulate a LP model for this problem and solve by using graphical method. 3) (Exercise 3.4.17. from [1]) Joyce and Marvin run a day care for preschoolers. They are trying to decide what to feed the children for lunches. They would like to keep their costs down, but also need to meet the nutritional requirements of the children. They have already decided to go with peanut butter and jelly sandwiches, and some combination of graham crackers, milk, and orange juice. The nutritional content of each food choice and its cost are given in the table below.

The nutritional requirements are as follows. Each child should receive between 400 and 600 calories. No more than 30 percent of the total calories should come from fat. Each child should consume at least 60 milligrams (mg) of vitamin C and 12 grams (g) of protein. Furthermore, for practical reasons, each child needs exactly 2 slices of bread (to make the sandwich), at least twice as much peanut butter as jelly, and at least 1 cup of liquid (milk and/or juice). Joyce and Marvin would like to select the food choices for each child which minimize cost while meeting the above requirements. (a) Formulate a linear programming model for this problem. 4) (Exercise 3.4.12. from [1]) The Medequip Company produces precision medical diagnostic equipment at two factories. Three medical centres have placed orders for this months production output. The table to the right shows what the cost would be for shipping each unit from each factory to each of these customers. Also shown are the number of units that will be produced at each factory and the number of units ordered by each customer.

A decision now needs to be made about the shipping plan for how many units to ship from each factory to each customer to minimize total shipping cost. (a) Formulate a linear programming model for this problem.

5) (Exercise 3.4.15. from [1]) A cargo plane has three compartments for storing cargo: front, center, and back. These compartments have capacity limits on both weight and space, as summarized below:

Furthermore, the weight of the cargo in the respective compartments must be the same proportion of that compartments weight capacity to maintain the balance of the airplane. The following four cargoes have been offered for shipment on an upcoming flight a s space is available:

Any portion of these cargoes can be accepted. The objective is to determine how much (if any) of each cargo should be accepted and how to distribute each among the compartments to maximize the total profit for the flight. (a) Formulate a linear programming model for this problem.

6) (Exercise 3.4.10. from [1]) Web Mercantile sells many household products through an on-line catalog. The company needs substantial warehouse space for storing its goods. Plans now are being made for leasing warehouse storage space over the next 5 months. Just how much space will be required in each of these months is known. However, since these space requirements are quite different, it may be most economical to lease only the amount needed each month on a monthby- month basis. On the other hand, the additional cost for leasing space for additional months is much less than for the first month, so it may be less expensive to lease the maximum amount needed for the entire 5 months. Another option is the intermediate approach of changing the total amount of space leased (by adding a new lease and/or having an old lease expire) at least once but not every month. The space requirement and the leasing costs for the various leasing periods are as follows:

The objective is to minimize the total leasing cost for meeting the space requirements. (a) Formulate a linear programming model for this problem. 7) Use the graphical method to find all optimal solutions for the following model: Max s.t. Z = 500x1 + 300x2 15x1 + 5x2 300 10x1 + 6x2 240 8x1 + 12x2 450 x1 0, x2 0 8) (Exercise 4.3.6. from [1]) Consider the following problem. Max s.t. Z = 5 x1 + 3 x2 + 4 x3 2x1 + x2 + x3 20 3x1 +x2 + 2x3 30 x1 0, x2 0, x3 0. You are given the information that the nonzero variables in the optimal solution are x2 and x3. (a) Describe how you can use this information to adapt the simplex method to solve this problem in the minimum possible number of iterations (when you start from the usual initial BF solution). Do not actually perform any iteration. (b) Use the procedure developed in part (a) to solve this problem by hand. 9) (Exercise 4.4.7. from [1]) Work through the simplex method step by step to solve the following problem. Max s.t. Z = 2x1 - x2 + x3, 3 x1 + x2 + x3 6 x1 - x2 + 2 x3 1 x1 + x2 - x3 2 x1 0, x2 0, x3 0

10)

(Exercise 4.4.6. from [1])

Consider the following problem.

Max s.t.

Z = 3x1 + 5x2 + 6x3, 2x1 + x2 + x3 4 x1 + 2 x2 + x3 4 x1 + x2 + 2 x3 4 x1 + x2 + x3 3 x1 0, x2 0, x3 0

(a) Work through the simplex method step by step in algebraic form. (b) Work through the simplex method in tabular form.

11) (Exercise 4.5.8. from [1]) Consider the following problem. Max s.t. Z = 50x1 + 25x2 + 20x3 + 40x4 2x1+ x2 x1 0, x2 0, x3 30 x3 + 2x4 40 0, x4 0

Work through the simplex method step by step to find all the optimal BF solutions.

12) (Exercise 4.6.7. from [1]) Consider the following problem. Max s.t. Z = 2x1 + 5x2 + 3x3, x1 - 2x2 + x3 20 2x1 + 4x2 + x3 = 50 x1 0, x2 0, x3 0 (a) Using the Big M method, work through the simplex method step by step to solve the problem. (b) Using the two-phase method, work through the simplex method step by step to solve the problem.

13) (Exercise 4.6.9. from [1]) Consider the following problem. Min s.t. Z = 3x1 + 2x2 + 4x3, 2x1 + x2 + 3x3 =60 3x1 + 3x2 + 5x3 120 x1 0, x2 0, x3 0 (a) Using the Big M method, work through the simplex method step by step to solve the problem. (b) Using the two-phase method, work through the simplex method step by step to solve the problem. Reference [1] Hillier, F.S., Liebermann G.J., Introduction to Operations Research , 9th edition, Mc-Graw Hill, Boston, 2010.