Question: A Linear programming problem has the following three constraints: 40X + 21Y
A Linear programming problem has the following three constraints: 40X + 21Y <= 840; 18X + 13Y= 234; and 9X - Y <= 96.2308 . The objective function is Min 20X + 47Y . What combination of X and Y will yield the optimum solution for this problem?
a. infeasible problem
b. 0 , 18
c. 13 , 0
d. 11 , 2.76923
e. unbounded problem
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
