Question: A Linear programming problem has the following three constraints: 20X + 45Y
A Linear programming problem has the following three constraints: 20X + 45Y <= 900; 13X + 22Y= 286; and 14X - Y <= 118.318 . The objective function is Min 3X + 35Y . What combination of X and Y will yield the optimum solution for this problem?
a.
22 , 0
b.
unbounded problem
c.
0 , 13
d.
infeasible problem
e.
9 , 7.68182
Clear my choice
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
