Question: A Linear programming problem has the following three constraints: 20X + 41Y
A Linear programming problem has the following three constraints: 20X + 41Y <= 820; 10X + 15Y= 150; and 19X - Y <= 29.3333 . The objective function is Min 17X + 42Y . What combination of X and Y will yield the optimum solution for this problem?
a.
2 , 8.66667
b.
0 , 10
c.
unbounded problem
d.
infeasible problem
e.
15 , 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
