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