Question

Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY i...

Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY if the feasible region is empty and UNBOUNDED if the objective function is unbounded.)

Minimize

c = x + y + z + w

subject to

x

+

y

80

x

+

z

60

x

+

y

w

50

y

+

z

w

50

x ≥ 0, y ≥ 0, z ≥ 0, w ≥ 0.

c = ?

(x, y, z, w) = ?

0 0
Add a comment Improve this question Transcribed image text
✔ Recommended Answer
Answer #1

Tableau #1
x      y      z      w      s1     s2     s3     s4     -p          
1      1      0      0      -1     0      0      0      0      40   
1      0      1      0      0      -1     0      0      0      60   
1      1      0      -1     0      0      1      0      0      50   
0      1      1      -1     0      0      0      1      0      50   
1      1      1      1      0      0      0      0      1      0    

Tableau #2
x      y      z      w      s1     s2     s3     s4     -p          
1      1      0      0      -1     0      0      0      0      40   
0      -1     1      0      1      -1     0      0      0      20   
0      0      0      -1     1      0      1      0      0      10   
0      1      1      -1     0      0      0      1      0      50   
0      0      1      1      1      0      0      0      1      -40  

Tableau #3
x      y      z      w      s1     s2     s3     s4     -p          
1      1      0      0      -1     0      0      0      0      40   
0      -1     1      0      1      -1     0      0      0      20   
0      0      0      -1     1      0      1      0      0      10   
0      2      0      -1     -1     1      0      1      0      30   
0      1      0      1      0      1      0      0      1      -60  

objective function is unbounded

Add a comment
Know the answer?
Add Answer to:
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY i...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT