Question: Consider the following linear programming problem: Minimize Z=20X1 + 30X2 Subject to:2X1 + 4X2 = < 800 6X1 + 3X2 => 300 X1, X2 =>

Consider the following linear programming problem:

Minimize Z=20X1 + 30X2

Subject to:2X1 + 4X2 =< 800

6X1 + 3X2 => 300

X1, X2 => 0

What is the optimum solution to this problem ( X1,X2 ) ?

a.(0,0)b.(50,0)c.(0,100)d.(400,0)e.none of the above.

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!