Question: A Linear programming problem has the following three constraints: 25X + 42Y
A Linear programming problem has the following three constraints: 25X + 42Y <= 1050; 14X + 21Y= 294; and 10X - Y <= 188.667 . The objective function is Min 4X + 44Y . What combination of X and Y will yield the optimum solution for this problem?
a.
21 , 0
b.
19 , 1.33333
c.
0 , 14
d.
unbounded problem
e.
infeasible problem
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
