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