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

A Linear programming problem has the following three constraints: 16X + 16Y <= 256; 9X + 15Y= 135; and 16X - Y <= 74 . The objective function is Min 19X + 25Y . What combination of X and Y will yield the optimum solution for this problem?

a. unbounded problem

b. infeasible problem

c. 15 , 0

d. 5 , 6

e. 0 , 9

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!