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

A Linear programming problem has the following three constraints: 29X + 39Y <= 1131; 13X + 20Y= 260; and 4X - Y <= 24.2 . The objective function is Min 6X + 41Y . What combination of X and Y will yield the optimum solution for this problem?

a.

20 , 0

b.

infeasible problem

c.

unbounded problem

d.

0 , 13

e.

8 , 7.8

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!