Consider the following linear programming problem:
Minimize 20X+30Y Subjec 2X+ 4Y s 800 6X + 3Y X, Y20 300
What is the optimum solution to this problem (X,Y)?
(400,0)
(50,0)
(0,0)
(0,100)
None of the above
Expert Answer
ANSWER: (50, 0)
Solution using LINGO is as follows
https://d2vlcm61l7u1fs.cloudfront.net/media%2F345%2F345d1d9c-6b0b-46a6-81de-60fc49837b66%2FphpicR7Ts.png