Question: A Linear programming problem has the following three constraints: 18X + 62Y
A Linear programming problem has the following three constraints: 18X + 62Y <= 1116; 7X + 21Y= 147; and 7X - Y <= 51.6667 . The objective function is Min 11X + 36Y . What combination of X and Y will yield the optimum solution for this problem?
a.
unbounded problem
b.
21 , 0
c.
0 , 7
d.
8 , 4.33333
e.
infeasible problem
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
