Question: A Linear programming problem has the following three constraints: 19X + 14Y
A Linear programming problem has the following three constraints: 19X + 14Y <= 266; 8X + 9Y= 72; and 5X - Y <= 27.3333 . The objective function is Min 6X + 38Y . What combination of X and Y will yield the optimum solution for this problem?
a.
0 , 8
b.
9 , 0
c.
infeasible problem
d.
6 , 2.66667
e.
unbounded problem
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
