Scribd
Upload
35 views

4 Simplex Example

The document provides a step-by-step example of using the simplex method to solve a linear programming problem in standard form with 3 decision variables (x1, x2, x3) and 3 constraints. The problem is to maximize the objective function Z = 3x1 + 2x2 + 5x3 subject to the given constraints. The simplex method is applied in tabular form, showing the calculations over multiple iterations to arrive at the optimal solution of x1* = 0, x2* = 100, x3* = 230 with maximum Z* = 1350.

Uploaded by

Honest
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

4 Simplex Example

The document provides a step-by-step example of using the simplex method to solve a linear programming problem in standard form with 3 decision variables (x1, x2, x3) and 3 constraints. The problem is to maximize the objective function Z = 3x1 + 2x2 + 5x3 subject to the given constraints. The simplex method is applied in tabular form, showing the calculations over multiple iterations to arrive at the optimal solution of x1* = 0, x2* = 100, x3* = 230 with maximum Z* = 1350.

Uploaded by

Honest
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Dr.

Tarhini INDE 302 14/09/15

 A complete example of the simplex method in tabular form

 Consider the LP max Z  3x1  2 x2  5 x3


s.t. x1  2 x2  x3  430
3x1   2 x3  460
x1  4 x2  420
x1  0, x2  0, x3  0

 Standard form max Z  3x1  2 x2  5 x3


s.t. x1  2 x2  x3  S1  430
3x1   2 x3  S2  460
x1  4 x2  S3  420
x1  0, x2  0, x3  0
 All constraints are “≤”and RHS > 0. Then, the starting solution is O.

x1 x2 x3 S1 S2 S3 RHS Ratio
Z -3 -2 -5 0 0 0 0 --
S1 1 2 1 1 0 0 430 430
S2 3 0 2 0 1 0 460 230
S3 1 4 0 0 0 1 420 

x1 x2 x3 S1 S2 S3 RHS Ratio
Z 4.5 -2 0 0 2.5 0 1150 --
S1 -0.5 2 0 1 -0.5 0 200 100
x3 1.5 0 1 0 0.5 0 230 
S3 1 4 0 0 0 1 420 105

x1 x2 x3 S1 S2 S3 RHS
Z 4 0 0 1 2 0 1350
x2 -0.25 1 0 0.5 -0.25 0 100
x3 1.5 0 1 0 0.5 0 230
S3 2 0 0 -2 1 1 20

 The optimal solution is x1* = 0, x2* = 100, x3* = 230 & Z* = 1350.

You might also like