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