Question: 32. A Linear programming problem has the following three constraints: 29X + 4Y

32. A Linear programming problem has the following three constraints: 29X + 4Y <= 116; 18X + 2Y= 36; and 13X - Y <= -18 . The objective function is Min 4X + 47Y . What combination of X and Y will yield the optimum solution for this problem?

a.

infeasible problem

b.

0 , 18

c.

unbounded problem

d.

0 , 18

e.

2 , 0

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!