7:59 PROBLEM 1: LP FORMULATION A company makes two products P and Q ing machines A and B. Each unit of P that is produced requires 50 minutes processing time on machine A and 30 minutes processing time on machine. Each unit of produced requires 24 minus processing time on machine Aand g eon machine B. Machine A is going to be available for 40 hours and machine is available for 35 hours. The profil per unit of Pis$25 and the profit per unit ofis $30. Company policy is to determine the production Quantity of each product in such a way as to maximize the total prove that the r e should not be exceeded. Given that is the number of units of Pandy is the number of units of Q. The Objective Function of the wave problem would be Max 2233 Max Z25x30 Max 2 x 35 Min Z4035 The constraint equation of machine A is OSOxy s40 O2 + 39 s 3500 50x2y s 2400 25x30 40 is The constraint equation of machine 30x + 3y s 2100 50x2 4000 0233 35 25-30 s 35 PROBLEM 2: GRAPHICAL SOLUTION graph 1: Feasible region Given the LP model: Max Z-10x + 20y Subject to x+ys14 y21 5x + y 2 15 x+y29 ile region for the given 1) Which region in the graph represents the f constraints? OA oc OD 2) What is the optimal solution for the above graphicallyustrated LP 7:59 region for the given Ty Which region in the graph represent constraints? OB OD 2) What is the optimal solution for the above graphicallyustrated LP model? Oy, 2100 15. 7.5. Z-165 Ox0.25. 13.75 2277.5 10 y 10 2300 PROBLEM 3: SIMPLEX METHOD Max 25x1 + 1002120 Subject to 31.12.2000 4x1.42.435 60 Determine the entering variable and the leaving a O X1 entering variable, S1 leaving variable OX2 entring variable S2 leaving able OX3 entering variable. Si leaving variable O X3 entering variable Sleaving variable What is the optimal solution for this given LP problem? O x 0.215.30. Z150 Ox0,2-0, 15. 2.180 Ox15 .30 275 Ox1-10, 2-1, 3-10. Z-180 Sub Never um password rough Google Forms Powered by Google Forms This form of Create your own Google Form Reply Reply all Forward