ECS716

Pn. Paezah, Oct. 18, 2011

Graphical Explanation for the

Two-Phase Method

Graphical Solution to
Original Problem

Min Z = 0.4X1 + 0.5X2

s.t.
0.3X1 + 0.1X2

X2
27

2.7

(C1)

0.5X1 + 0.5X2

= 6

(C2)

0.6X1 + 0.4X2

(C3)

X1, X2 0

C1

Corner point Z
15

C3

12
(6,6)

(7.5,4)

C2
9

10

15

X1

(6,6)

5.4

(7.5,4)

5.25

Optimal solution:
X1= 7.5, X2= 4

Phase I:

Iteration 1
Min Z = A1 + A2

Phase I allows the

shaded region to be
artificially feasible

s.t.

0.3X1 + 0.1X2 + S1
0.5X1 + 0.5X2
0.6X1 + 0.4X2

X2
27
C1

15

Cj
0
1
1

C3

12
ARTIFICIAL
FEASIBLE
REGION

(6,6)

Basis
S1
A1
A2
Zj
Cj-Zj

X1
0
0.3
0.5
0.6
1.1
-1.1

X2
0
0.1
0.5
0.4
0.9
-0.9

(7.5,4)
C2
9

(0,0)

10

15

X1

= 2.7
+ A1

= 6

- S2 + A2 = 6
X1, X2 ,S1, S2 ,A1, A2 0
S1
0
1
0
0
0
0

A1
1
0
1
0
1
0

S2
0
0
0
-1
-1
1

A2
1
0
0
1
1
0

RHS
2.7
6
6
12

Phase I:

Iteration 2

X2
27
C1

15

Cj
0
1
1

Basis

X1
0

X1
A1
A2
Zj
Cj-Zj

1
0
0
0
0

X2
0
1/3
1/3
0.2
16/30
-16/30

C3

12
(6,6)
(7.5,4)
C2
(9,0)

15

X1

S1
0

A1
1

S2
0

A2
1

10/3
-5/3
-2
-11/3
11/3

0
1
0
0
0

0
0
-1
-1
1

0
0
1
1
0

RHS
9
1.5
0.6
2.1

Phase I:

Iteration 3

X2
27
C1

15

Cj
0
1
0

Basis
X1
A1
X2
Zj
Cj-Zj

X1
0
1
0
0
0
0

X2
0
0
0
1
0
0

S1
0
20/3
5/3
-10
5/3
-5/3

C3

12
(6,6)

(7.5,4)
(8,3)
C2
9

15

X1

A1
1
0
1
0
0
0

S2
0
5/3
5/3
-5
5/3
-5/3

A2
1
-5/3
-5/3
5
-5/3
8/3

RHS
8
0.5
3
0.5

Phase I:

Iteration 4

X2
27
C1

15

Cj
0
0
0

Basis
X1
S1
X2
Zj
Cj-Zj

C3

X1
0
1
0
0
0
0

X2
0
0
0
1
0
0

S1
0
0
1
0
0
0

A1
1
-4
3/5
6
0
1

S2
0
-5
1
5
0
0

A2
1
5
-1
-5
0
0

RHS
6
0.3
6
0

Solution is optimal.

12
(6,6)

Case 2

Min Z=0
No artificial variable in the basis.

(7.5,4)
C2
9

15

X1

Phase II: Iteration 1

Min Z = 0.4X1 + 0.5X2

Use the real objective

function
Use Phase I final tableau
Drop artificial var. column
X2

s.t.

0.3X1 + 0.1X2 + S1

= 2.7

0.5X1 + 0.5X2

= 6

0.6X1 + 0.4X2

- S2 = 6

X1, X2 ,S1, S2 0

27

Iteration 1

C1

15

Cj
0.4
0
0.5

C3

Basis
X1
S1
X2
Zj
Cj-Zj

12
(6,6)

X1
0.4
1
0
0
0.4
0

(7.5,4)
C2
9

15

X1

X2
0.5
0
0
1
0.5
0

S1
0
0
1
0
0
0

S2
0
-5
1
5
0.5
-0.5

RHS
6
0.3
6
5.4

Phase II:

Iteration 2

X2
27
C1

15

Cj
0.4
0
0.5

C3

Basis

X1
S2
X2
Zj
Cj-Zj

12
(6,6)

X1
0.4
1
0
0
0.4
0

(7.5,4)

S1
0
5
1
-5
-0.5
0.5

S2
0
0
1
0
0
0

RHS
7.5
0.3
4.5
5.25

Optimal solution:
X1= 7.5, X2= 4

C2
9

X2
0.5
0
0
1
0
0

15

X1