Question: A Linear programming problem has the following three constraints: 23X + 13Y
A Linear programming problem has the following three constraints: 23X + 13Y <= 299; 16X + 12Y= 192; and 18X - Y <= 100 . The objective function is Min 20X + 20Y . What combination of X and Y will yield the optimum solution for this problem?
a.
6 , 8
b.
infeasible problem
c.
12 , 0
d.
unbounded problem
e.
0 , 16
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
