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