Question: Quick Ltd. manufactures two products; A & B using machines X and Y. For each machine, there is a maximum of 200 machine hours available

Quick Ltd. manufactures two products; A \& B using machines X and Y. For each machine, there is a maximum of 200 machine hours available each week and a maximum of 400 Labour hours are dedicated to the production of products A \& B each week. The resource usage per unit of each product is shown in the table below: Required: (a) Formulate a linear programming problem (b) Graphically solve the problem (i) Identify the binding and non- binding constraints (ii) Determine the slack value for each constraint (iii) Determine the shadow price for each constraint (1 Mark) (3 Marks) (2 Marks) (2 Marks) (2 Marks) (c) Use the simplex method to solve the problem (on your final table, show the shadow price for each constraint, and the values for the decision variables
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
