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