Question: QUESTION TWO (a) Solve the following Linear programming problem using the simplex method: Maximize Z = 10X, +15X2 + 20X, subject to: 2X1 + 4X2

QUESTION TWO (a) Solve the following Linear

QUESTION TWO (a) Solve the following Linear programming problem using the simplex method: Maximize Z = 10X, +15X2 + 20X, subject to: 2X1 + 4X2 +6X, 24 3X1 +9X, +6X, 0 (15 Marks) (6) Suppose X1, X3, X, in (a) refer to number of red, blue, and green balloons respectively which are produced by a company per day. And Z is the total profit obtained after selling these balloons. Interpret your answer obtained in (a). (5 Marks) (c) Write the dual of the following linear programming problem: Minimize Z = 2X, - 3X, + 4Xg subject to: 3X: + 4X2 +5X; > 9 6X1 + X2+3X3 > 4 7X1 - 2X, - X: 10 511 - 2X2 + X3 > 3 4X1 +6X, -2X3 > 3 X1, X, and X3 > 0 (5 Marks) [TOTAL: 25 Marks)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!