Scribd
Upload
189 views

Two Phase Simplex PDF

The document summarizes solving a linear programming problem using the two-phase simplex method. [1] It presents the original LP problem and transforms it into standard form. [2] A Phase I problem is constructed by relaxing constraints and introducing a new objective to find an initial basic feasible solution. [3] Tableaus are constructed and variables enter and leave the basis until the Phase I optimal value is 0, showing the original problem is feasible. Phase II then solves the original LP problem to find the optimal solution.

Uploaded by

amo1123
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
189 views

Two Phase Simplex PDF

The document summarizes solving a linear programming problem using the two-phase simplex method. [1] It presents the original LP problem and transforms it into standard form. [2] A Phase I problem is constructed by relaxing constraints and introducing a new objective to find an initial basic feasible solution. [3] Tableaus are constructed and variables enter and leave the basis until the Phase I optimal value is 0, showing the original problem is feasible. Phase II then solves the original LP problem to find the optimal solution.

Uploaded by

amo1123
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/ 2

An Example of Two Phase Simplex Method

AdvOL @McMaster, http://optlab.mcmaster.ca


February 2, 2009.

Consider the following LP problem.

max z = 2x1 + 3x2 + x3


s.t. x1 + x2 + x3 40
2x1 + x2 x3 10
x2 + x3 10
x1 , x 2 , x 3 0

It can be transformed into the standard form by introducing 3 slack variables x4 , x5 and x6 .

max z = 2x1 + 3x2 + x3


s.t. x1 + x2 + x3 + x4 = 40
2x1 + x2 x3 x5 = 10
x2 + x3 x6 = 10
x1 , x 2 , x 3 , x 4 , x 5 , x 6 0

There is no obvious initial basic feasible solution, and it is not even known whether there exists
one. We can use Phase I method to find out. Consider the following LP problem derived from
the original one by relaxing the second and third constraints and introducing a new objective
function.
min x7 + x8 , (or max w = x7 x8 )
s.t. x1 + x2 + x3 + x4 = 40
2x1 + x2 x3 x5 + x7 = 10
x2 + x3 x6 + x8 = 10
x1 , x 2 , x 3 , x 4 , x 5 , x 6 , x 7 , x 8 0

This problem (Phase I) has an initial basic feasible solution with basic variables being x4 , x7
and x8 . If the minimum value of x7 + x8 is 0, then both x7 and x8 are 0. As the result, the
optimal solution of the Phase I problem is an basic feasible solution of the original problem.
If the minimum value of x7 + x8 is bigger than 0, then the original problem is not feasible. We
construct tableaus to solve the Phase I problem. The objective value w should be written in
terms of non-basic variables:

w = x7 x8 = 20 + 2x1 x5 x6 .

The initial tableau is shown below (the basic variables are shown in bold font).

w x1 x2 x3 x4 x5 x6 x7 x8
1 -2 0 0 0 1 1 0 0 = -20
0 1 1 1 1 0 0 0 0 = 40
0 2 1 -1 0 -1 0 1 0 = 10
0 0 -1 1 0 0 -1 0 1 = 10
The entering and leaving variables would be x1 and x7 respectively:

w x1 x2 x3 x4 x5 x6 x7 x8
1 0 1 -1 0 0 1 1 0 = -10
0 0 0.5 1.5 1 0.5 0 -0.5 0 = 35
0 1 0.5 -0.5 0 -0.5 0 0.5 0 = 5
0 0 -1 1 0 0 -1 0 1 = 10

The entering and leaving variables would be x3 and x8 respectively:

w x1 x2 x3 x4 x5 x6 x7 x8
1 0 1 0 0 0 0 1 1 = 0
0 0 2 0 1 0.5 1.5 -0.5 -1.5 = 20
0 1 0 0 0 -0.5 -0.5 0.5 0.5 = 10
0 0 -1 1 0 0 -1 0 1 = 10

The optimal value of the Phase I problem is w = 0. So the original problem is feasible, and a
basic feasible solution is x1 = 10, x3 = 10, x4 = 20, x2 = x5 = x6 = 0. Now we can start Phase
II. Again the objective value z should be represented by the non-basic variables:

z = 2x1 + 3x2 + x3 = 30 + 4x2 + x5 + 2x6 .

The initial tableau is (the last Phase I tableau with x7 and x8 taken away):

z x1 x2 x3 x4 x5 x6
1 0 -4 0 0 -1 -2 = 30
0 0 2 0 1 0.5 1.5 = 20
0 1 0 0 0 -0.5 -0.5 = 10
0 0 -1 1 0 0 -1 = 10

The entering and leaving variables would be x2 and x4 respectively:

z x1 x2 x3 x4 x5 x6
1 0 0 0 2 0 1 = 70
0 0 1 0 0.5 0.25 0.75 = 10
0 1 0 0 0 -0.5 -0.5 = 10
0 0 0 1 0.5 0.25 -0.25 = 20

Thus, the optimal value z = 70, and the optimal solution is x1 = x2 = 10, x3 = 20, x4 = x5 =
x6 = 0.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy