3.1-10 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) x1: # hot dogs they should produce each week x2: # hot dog buns they should produce each week Objective is maximize the profit so; Max Z = 0,80 x1 + 0,30 x2 Flour constraint: 0,1 x2 200 Pork product constraints: x1 800 0,25 x1 800 Labor constraint: 3x1+2x2 12000 (40 hours = 2400 minutes, 2400 minutes per worker, so for 5 worker= 2400*5 =12000 minutes) Non-negativity; x1, x2 0 So LP for this problem: Max Z = 0,80 x1 + 0,30 x2 St; 0,1 x2 200 0,25 x1 800 3x1+2x2 12000 b) 1) 0,1 x2 = 200 x2 = 2000 2) 0,25 x1 = 800 x1 = 3200 3) 3x1+2x2 = 12000 (0, 6000 ) and (4000,0)

Optimal Solution: x1*=3200 , x2*=1200 and Z*=2920

3.1-11 The Omega Manufacturing Company has discontinued the production of a certain unprofitable product line. This act created considerable excess production capacity. Management is considering devoting this excess capacity to one or more of three products; call them products 1, 2, and 3. The available capacity on the machines that might limit output is summarized in the following table:

The number of machine hours required for each unit of the respective products is

The sales department indicates that the sales potential for products 1 and 2 exceeds the maximum production rate and that the sales potential for product 3 is 20 units per week. The unit profit would be $50, $20, and $25, respectively, on products 1, 2, and 3. The objective is to determine how much of each product Omega should produce to maximize profit. (a) Formulate a linear programming model for this problem. (b) Solve this model by the simplex method. axi =the number of units of product i produced for i=1,2,3 x1: # Product 1 x2: # Product 2 x3: # Product 3 Objective is to maximize the profit; Max Z = 50 x1 +20 x2 +25 x3 Constraints: Machine Hours for Milling Machine: 9 x1 +3 x2 +5 x3 500 Machine Hours for Lathe: 5 x1 +4 x2 350 Machine Hours for Grinder: 3 x1 + 2 x3 150 Sales Potential: x3 20 Non-negativity; x1, x2, x3 0

b- Simplex: Objective function: Z -50 x1 -20 x2 - 25 x3 St 9 x1 + 3 x2 +5 x3 + s1 5 x1 + 4 x2 + s2 3 x1 + +2 x3 + s3 x3 + s4 x1, x2, x3 s1 s2 s3 0 solution is on excel sheet Manuel solution: min ratio test 55,6 70,0 50,0 = 500 =350 = 150 = 20

iteration Z s1 s2 s3 0 s4

x1 -50 9 5 3 0 x1 0 0 0 1 0 x1 0 0 0 1 0

x2 -20 3 4 0 0 x2 -20 3 4 0 0 x2 0 1 0 0 0

x3 -25 5 0 2 1 x3 8 1/3 -1 -3 1/3 2/3 1 x3 1 2/3 - 1/3 -2 2/3 1

s1 0 1 0 0 0 s1 0 1 0 0 0 s1 6 2/3 1/3 -1 1/3 0 0

s2 0 0 1 0 0 s2 0 0 1 0 0 s2 0 0 1 0 0

s3 0 0 0 1 0 s3 16 2/3 -3 -1 2/3 1/3 0 s3 -3 1/3 -1 2 1/3 1/3 0

s4 0 0 0 0 1 s4 0 0 0 0 1 s4 0 0 0 0 1

RHS 0 500 350 150 20 RHS 2500 50 100 50 20 RHS

Z s1 s2 x1 1 s4

min ratio test 16 2/3 25

Z x2 s2 x1 2 s4

min ratio 2833 1/3 test 16 2/3 33 1/3 14 2/7 50 150 20

Min ratio test= RHS values/coef. Of ent. Variable For the first iteration, we see that x1 is entering variable since -50 is the most minimum one. And s3 is the leaving variable since 50,from minimum ratio test, is the minimum one. We want the intersection of entering variable and leaving variable (pivot cell) is to be 1. So for that, we divide 3 to 3 and we get 1. And then we divide whole row to 3:

Z s1 s2 x1 1 s4

x1 0 0 0 1 (3/3) 0

x2 -20 3 4 0 (0/3) 0

x3 8 1/3 -1 -3 1/3 2/3(2/3) 1

s1 0 1 0 0 (0/3) 0

s2 0 0 1 0 (0/3) 0

s3 16 2/3 -3 -1 2/3 1/3(1/3) 0

s4 0 0 0 0 (0/3) 1

RHS 2500 50 100 50 (150/3) 20