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