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