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