Scribd
Upload
2 views

Simplex_Method_Solution

The document outlines the application of the Simplex Method to maximize the objective function Z = 8x1 + 5x2 + 10x3 under specific constraints. It details three iterations of the Simplex algorithm, showing the pivot operations and updated tableau at each step. The final solution indicates that x1 = 50, x2 = 91.67, x3 = 25, resulting in a maximum contribution of Z = 1050.

Uploaded by

ezekielakpejeriosare
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Simplex_Method_Solution

The document outlines the application of the Simplex Method to maximize the objective function Z = 8x1 + 5x2 + 10x3 under specific constraints. It details three iterations of the Simplex algorithm, showing the pivot operations and updated tableau at each step. The final solution indicates that x1 = 50, x2 = 91.67, x3 = 25, resulting in a maximum contribution of Z = 1050.

Uploaded by

ezekielakpejeriosare
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Simplex Method Solution

Problem:

Maximize Z = 8x1 + 5x2 + 10x3, subject to:

1. 2x1 + 3x2 + x3 <= 400 (Machine hours)

2. x1 + x3 <= 150 (Special component)

3. 2x1 + 4x3 <= 200 (Special alloy)

4. x1 <= 50 (Trade agreement)

5. x1, x2, x3 >= 0

Solution using Simplex Method:

Iteration 1:

Pivot: x1 enters, s4 leaves.

Updated Tableau:

Basis x1 x2 x3 s1 s2 s3 s4 Solution

s1 0 3 1 1 0 0 -2 300

s2 0 0 1 0 1 0 -1 100

s3 0 0 4 0 0 1 -2 100

x1 1 0 0 0 0 0 1 50

Z 0 -5 -10 0 0 0 8 400

Iteration 2:

Pivot: x2 enters, s1 leaves.

Updated Tableau:

Basis x1 x2 x3 s1 s2 s3 s4 Solution

x2 0 1 0.333 0.333 0 0 -0.667 100


s2 0 0 1 0 1 0 -1 100

s3 0 0 4 0 0 1 -2 100

x1 1 0 0 0 0 0 1 50

Z 0 0 -8.33 1.67 0 0 4.33 500

Iteration 3:

Pivot: x3 enters, s3 leaves.

Updated Tableau:

Basis x1 x2 x3 s1 s2 s3 s4 Solution

x2 0 1 0 0.333 0 -0.083 -0.667 91.67

s2 0 0 0 0 1 -0.25 -1 100

x3 0 0 1 0 0 0.25 -0.5 25

x1 1 0 0 0 0 -0.25 1.5 50

Z 0 0 0 2.08 0 2.08 0.83 1050

Final Solution:

x1 = 50, x2 = 91.67, x3 = 25

Maximum Contribution, Z = 1050

You might also like