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