Question: A Linear programming problem has the following three constraints: 32X + 28Y
A Linear programming problem has the following three constraints: 32X + 28Y <= 896; 19X + 13Y= 247; and 19X - Y <= 165.154 . The objective function is Min 11X + 22Y .
What combination of X and Y will yield the optimum solution for this problem?
a. unbounded problem
b. 13 , 0
c. 9 , 5.84615
d. 0 , 19
e. infeasible problem
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
