Scribd
Upload
3 views1 page

Simplex Method Final Step Example

The document outlines the final step of a Simplex Method iteration, detailing the equations and variable adjustments leading to the optimal solution. The optimal solution is identified as (0.4, 1.2, 3, 0, 0, 0) with an objective value of Z = 33.8. The optimality test confirms that all nonbasic variable coefficients are nonpositive.

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 Final Step Example

The document outlines the final step of a Simplex Method iteration, detailing the equations and variable adjustments leading to the optimal solution. The optimal solution is identified as (0.4, 1.2, 3, 0, 0, 0) with an objective value of Z = 33.8. The optimality test confirms that all nonbasic variable coefficients are nonpositive.

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 — Final Step

(1) -2.5x1 + x3 + 2x4 - 1.5x5 = 2 ⇒ x3 = 2 + 2.5x1


(2) 2x1 + x2 - x4 + x5 = 2 ⇒ x2 = 2 - 2x1 ⇒ x1 ≤ 1
(3) 5x1 - 3x4 + 2x5 + x6 = 2 ⇒ x6 = 2 - 5x1 ⇒ x1 ≤ 0.4 ← minimum

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

(0) Z + 2.3x4 + 0.3x5 + 0.9x6 = 33.8


(1) x3 + 0.5x4 - 0.5x5 + 0.5x6 = 3 ⇒ x3 = 3
(2) x2 + 0.2x4 + 0.2x5 - 0.4x6 = 1.2 ⇒ x2 = 1.2
(3) x1 - 0.6x4 + 0.4x5 + 0.2x6 = 0.4 ⇒ x1 = 0.4

Optimality Test: The coefficients of all nonbasic variables are nonpositive, so the solution
(0.4, 1.2, 3, 0, 0, 0) is optimal.
Objective value Z = 33.8

You might also like