Question: A Linear programming problem has the following three constraints: 29X + 21Y
A Linear programming problem has the following three constraints: 29X + 21Y <= 609; 11X + 14Y= 154; and 11X - Y <= 0.785714 . The objective function is Min 19X + 43Y . What combination of X and Y will yield the optimum solution for this problem? a. 1 , 10.2143 b. unbounded problem c. 0 , 11 d. 14 , 0 e. infeasible problem
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
