Share
Explore BrainMass

Linear Programming : Simplex Method (10 Problems)

Please see the attached file for the fully formatted problems.

Attachments

Solution Preview

Please see the attached file.

-----------------------------------------------------------------

Answers for questions on page 1.

(1) A

We can see from the 1st, 3rd and 7th columns that the optimal solution is
(63, 0, 40) , and the optimal value is 1148.

(2) The table has some problem, so I cannot give you the correct answer. Can you rewrite it and send it to me so that I can give you the answer.

(3) B

Answers for questions on page 2.

(1) D. (10, 0)

(2) B. 66

We use simplex method to obtain an optimal solution: x=0 and y=16.5.
---------------------------------
Tableau #1
x y s1 s2 z
3 1 1 0 0 24
6 4 0 1 0 ...

Solution Summary

Ten LP related problems are solved. Pivoting, Simplex tableaux and feasible regions are discussed.

$2.19