Scribd
Upload
3 views1 page

Simplex Method Iteration Example Part 2

The document presents an example of the Simplex Method iteration, detailing the equations and constraints for variables x1, x2, x3, x4, x5, and x6. It identifies x4 as the leaving basic variable and sets initial values for x1, x5, and x4. An optimality test indicates that the current solution is not optimal, prompting the selection of x1 as the entering basic variable.

Uploaded by

Cát Tường
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views1 page

Simplex Method Iteration Example Part 2

The document presents an example of the Simplex Method iteration, detailing the equations and constraints for variables x1, x2, x3, x4, x5, and x6. It identifies x4 as the leaving basic variable and sets initial values for x1, x5, and x4. An optimality test indicates that the current solution is not optimal, prompting the selection of x1 as the entering basic variable.

Uploaded by

Cát Tường
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Simplex Method Iteration Example — Part 2

(1)
-1.25x1 + 0.5x3 + x4 - 0.75x5 = 1 ⇒ x4 = 1 - 0.5x3 ⇒ x3 ≤ 2 ← minimum
(2)
0.75x1 + x2 + 0.5x3 + 0.25x5 = 3 ⇒ x2 = 3 - 0.5x3 ⇒ x3 ≤ 6
(3)
1.25x1 + 1.5x3 - 0.25x5 + x6 = 5 ⇒ x6 = 5 - 1.5x3 ⇒ x3 ≤ 10/3

We choose x4 as the leaving basic variable. Set x1 = x5 = x4 = 0.

(0) Z - 4.5x1 + 5x4 - 1.5x5 = 32


(1) -2.5x1 + x3 + 2x4 - 1.5x5 = 2 ⇒ x3 = 2
(2) 2x1 + x2 - x4 + x5 = 2 ⇒ x2 = 2
(3) 5x1 - 3x4 + 2x5 + x6 = 2 ⇒ x6 = 2

Optimality Test: The coefficient of x1 is positive, so the solution (0, 2, 2, 0, 0, 2) is not


optimal.

Let x1 be the entering basic variable.

You might also like