Solve the linear programming problems in Problems 4144 by applying the simplex method to the dual problem.

Question:

Solve the linear programming problems in Problems 41–44 by applying the simplex method to the dual problem. 

Minimize subject to C= 5x + 4x + 5x3 + 6x4 x + x = 12 x3 + x4  25 x + x3 = 20 x + x4  15 X1, X2, X3, X4  0

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: