Question: A Linear programming problem has the following three constraints: 15X + 31Y

A Linear programming problem has the following three constraints: 15X + 31Y <= 465; 13X + 15Y= 195; and 17X - Y <= 201.4 . The objective function is Min 14X + 21Y . What combination of X and Y will yield the optimum solution for this problem? a. 12 , 2.6 b. 0 , 13 c. unbounded problem d. 15 , 0 e. infeasible

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!