Tutorial 9 - Constrained Optimization & Linear Programming

1. Mr. Momo owns a bakery and he specializes on three types of frozen cakes, namely Cake A, Cake B and Cake C. Mr. Momo uses many ingredients to bake the cakes, but one ingredient comes in a limited amount every week. Mr. Momo calls this Secret Ingredient. One Cake A requires 6 unit of Secret Ingredient, one Cake B requires 4 unit of Secret Ingredient, and one Cake C requires 7 unit of the Secret Ingredient. As the Secret Ingredient is very expensive, Mr. Momo can only afford to buy 2200 unit of the Secret Ingredient every week. Mr. Momos workers work exactly 54 hours a week and they need 0.05 hour to bake one Cake A, 0.2 hour to bake one Cake B, and 0.1 hour to bake one Cake C. Mr. Momos bakery is quite small and he can only store 420 frozen cakes every week before they are sent to his customers. Mr. Momo says that one Cake A gives him a net profit of RM 20, one Cake B gives RM 20 and one Cake C gives RM 25. Use the Simplex method to calculate the number of Cake A, Cake B and Cake C that Mr. Momo needs to bake in one week in order to maximise his profit. (Max. profit =8760, Cake A =0, Cake B =158, Cake C =224)

2. A factory makes two types of product, namely Product A and Product B. The factory workers need 40 hour a week to produce these two products. The main materials used to produce these products are wood, and the factory buys 9500 kg of wood per week. Only one product can be created at a time by the workers, whereby one Product A requires 0.04 hour and one Product B requires 0.12 hour to be made. To make one product A, 20 kg of wood is required, and for one Product B, 5kg of wood is required. The factory can only store up to 550 products in one week before they are shipped out to customers. The company makes a profit of RM 45 for one Product A, and one Product B gives a profit of RM 20. a. Set up a linear programming problem to maximize weekly profit for the company b. Use the Simplex method to solve for maximum profit, and the number of Products A and B to get this maximum profit. (Max. profit =22250, Product A =450, Product B =100) 3. Mr. Momo owns a factory. He makes two birthday cards, namely Card A and Card B. Momo wants to calculate the profit for his company monthly. The following information summarizes the operation of the factory in one month. Card A 0.55 hour 120 units 8 units RM 125 Card B 0.6 hour 85 units 15 units RM 95

Time to produce 1 unit Colour paper Water colour Profit

The factory buys 11010 units of colour paper per month and 1200 units of water colour per month. Mr. Momos workers work no more than 112 hours a month. Using the Simplex Method, calculate the maximum profit, and the number of Card A and Card B that will give the company this maximum profit. (Max. profit = 11791.21, Card A = 56, Card B = 50) 4. Mr. Momo owns and operates a nuclear plant consisting of two reactors. Every day, the plant delivers a certain amount of power to the national electricity grid. The power (and the losses) produced by each reactor depends on amount of the two materials used, namely Liquid A and Vapour B. Every day, Mr. Momo buys 8500 units of Liquid A and 900 units of Vapour B to operate his plant. In its daily operations, the nuclear plant is capable of producing a total power P, P = 55P1 + 35P2 Losses, where P1 and P2 are power output from Reactor 1 and Reactor 2, respectively and the Losses is the total power loss from both Reactor 1 and Reactor 2. For Reactor 1, 78 units of Liquid A and 7 units of Vapour B are required to produce one unit of power. The power loss L1 is estimated by L 1 = 2L A + 3VB where LA and VB are the amount of Liquid A and Vapour B used respectively. For Reactor 2, 48 units of Liquid A and 10 units of Vapour B are required to produce one unit of power. The power loss is estimated as 60% of the power loss in Reactor 1. Formulate the linear programming equations for the above problem and use the Simplex Method to calculate the maximum units of power that the nuclear plant can produce every day. (From Final Exam Semester 2 2008/2009), (P = 5738.196, P1 = 94.1441, P2 = 24.0991) 5. Mr. Momo owns a biscuit factory. He makes two types of biscuits, namely Biscuit A and Biscuit B. Momo wants to calculate the profit for his company monthly. The following information summarizes the operation of the factory in one month. For one Biscuit A - The workers need to spend 0.6 hour, and they require 140 unit of flour, and 10 unit of sugar. Profit = RM 140 For one Biscuit B - The workers need to spend 0.8 hour, and they require 100 unit of flour, and 17 unit of sugar. Profit = RM 110 The factory buys 12100 unit of flour per month and 1250 unit of sugar per month. Mr. Momo workers work no more than 115 hours a month. The factory has no problem in storing any number of biscuits in their warehouse. Use the Simplex method to calculate the maximum profit, and the number of Biscuit A and Biscuit B that will give the company this maximum profit. (From Test 2 Semester 1
2008/2009), (Max. profit = 12491.23, Bisciut A = 58, Biscuit B = 39)