Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog buns. They gr... more Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog buns. They grind their own flour for the hot dog buns at a maximum rate of 200 pounds per week. Each hot dog bun requires 0.1 pound of flour. They currently have a contract with Pigland, Inc., which specifies that a delivery of 800 pounds of pork product is delivered every Monday. Each hot dog requires ¼ pound of pork product. All the other ingredients in the hot dogs and hot dog buns are in plentiful supply. Finally, the labor force at Weenies and Buns consists of 5 employees working full time (40 hours per week each). Each hot dog requires 3 minutes of labor, and each hot dog bun requires 2 minutes of labor. Each hot dog yields a profit of $0.80, and each bun yields a profit of $0.30. Weenies and Buns would like to know how many hot dogs and how many hot dog buns they should produce each week so as to achieve the highest possible profit. (a) Formulate a linear programming model for this problem. (b) Use the graphical method to solve this model. a) x 1: # hot dogs they should produce each week x 2: # hot dog buns they should produce each week Objective is maximize the profit so; Max Z = 0,80 x 1 + 0,30 x2 Flour constraint: 0,1 x 2 ≤ 200 Pork product constraints: ¼ x 1 ≤ 800 0,25 x 1 ≤ 800 Labor constraint: 3x 1 +2x 2 ≤ 12000 (40 hours = 2400 minutes, 2400 minutes per worker, so for 5 worker= 2400*5 =12000 minutes) Non-negativity; x 1 , x 2 ≥ 0 So LP for this problem: Max Z = 0,80 x 1 + 0,30 x 2 St; 0,1 x 2 ≤ 200 0,25 x 1 ≤ 800 3x 1 +2x 2 ≤ 12000 b) 1. 0,1 x 2 = 200 x 2 = 2000 2. 0,25 x 1 = 800 x1 = 3200 3. 3x 1+2x2 = 12000 (0, 6000) and (4000,0)
Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog buns. They gr... more Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog buns. They grind their own flour for the hot dog buns at a maximum rate of 200 pounds per week. Each hot dog bun requires 0.1 pound of flour. They currently have a contract with Pigland, Inc., which specifies that a delivery of 800 pounds of pork product is delivered every Monday. Each hot dog requires ¼ pound of pork product. All the other ingredients in the hot dogs and hot dog buns are in plentiful supply. Finally, the labor force at Weenies and Buns consists of 5 employees working full time (40 hours per week each). Each hot dog requires 3 minutes of labor, and each hot dog bun requires 2 minutes of labor. Each hot dog yields a profit of $0.80, and each bun yields a profit of $0.30. Weenies and Buns would like to know how many hot dogs and how many hot dog buns they should produce each week so as to achieve the highest possible profit. (a) Formulate a linear programming model for this problem. (b) Use the graphical method to solve this model. a) x 1: # hot dogs they should produce each week x 2: # hot dog buns they should produce each week Objective is maximize the profit so; Max Z = 0,80 x 1 + 0,30 x2 Flour constraint: 0,1 x 2 ≤ 200 Pork product constraints: ¼ x 1 ≤ 800 0,25 x 1 ≤ 800 Labor constraint: 3x 1 +2x 2 ≤ 12000 (40 hours = 2400 minutes, 2400 minutes per worker, so for 5 worker= 2400*5 =12000 minutes) Non-negativity; x 1 , x 2 ≥ 0 So LP for this problem: Max Z = 0,80 x 1 + 0,30 x 2 St; 0,1 x 2 ≤ 200 0,25 x 1 ≤ 800 3x 1 +2x 2 ≤ 12000 b) 1. 0,1 x 2 = 200 x 2 = 2000 2. 0,25 x 1 = 800 x1 = 3200 3. 3x 1+2x2 = 12000 (0, 6000) and (4000,0)
Uploads
Papers by Carlos Olivera