3/19/25, 9:29 PM Two-Phase method Example-2

We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more Accep

Support us

Try our new - Enter problem or search problem

Home What's new College Algebra Games
Algebra Matrix & Vector Numerical Methods Statistical Methods Operation Research Word Problems

Home > Operation Research calculators > Two-Phase method example

3. Two-Phase method example ( Enter your problem )

Other related methods
1. Algorithm & Example-1
2. Example-2 0. Formulate linear programming model
3. Example-3 1. Graphical method
4. Infeasible solution example 2. Simplex method (BigM method)
3. Two-Phase method
4. Primal to dual conversion
5. Dual simplex method
6. Integer simplex method
7. Branch and Bound method
8. 0-1 Integer programming problem
9. Revised Simplex method

1. Algorithm & Example-1 3. Ex

(Previous example) (Next ex

2. Example-2

Find solution using Two-Phase method

MIN Z = 5x1 + 2x2 + 10x3
subject to
x1 - x3 <= 10
x2 + x3 >= 10
and x1,x2,x3 >= 0

Solution:
Problem is
Min Z = 5 x 1 + 2 x 2 + 10 x 3
subject to
x1 - x 3 ≤ 10
x 2 + x 3 ≥ 10
and x 1, x 2, x 3 ≥ 0;

-->Phase-1<--

The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate

1. As the constraint-1 is of type ' ≤ ' we should add slack variable S 1

2. As the constraint-2 is of type ' ≥ ' we should subtract surplus variable S 2 and add artificial variable A 1

After introducing slack,surplus,artificial variables

Min Z = A1
subject to
x1 - x3 + S1 = 10
x2 + x3 - S 2 + A 1 = 10
and x 1, x 2, x 3, S 1, S 2, A 1 ≥ 0

Iteration-1 Cj 0 0 0 0 0 1

MinRatio
B CB XB x1 x2 x3 S1 S2 A1 XB
x2

https://cbom.atozmath.com/example/CBOM/Simplex.aspx?q=tp&q1=E2 1/3
3/19/25, 9:29 PM Two-Phase method Example-2

S1 0 10 1 0 -1 1 0 0 ---

10
A1 1 10 0 (1) 1 0 -1 1 = 10 →
1

Z=0 Zj 0 1 1 0 -1 1

Cj - Zj 0 -1 ↑ -1 0 1 0

Negative minimum C j - Z j is - 1 and its column index is 2. So, the entering variable is x 2.

Minimum ratio is 10 and its row index is 2. So, the leaving basis variable is A 1.

∴ The pivot element is 1.

Entering = x 2, Departing = A 1, Key Element = 1

R 2(new) = R 2(old)

R 1(new) = R 1(old)

Iteration-2 Cj 0 0 0 0 0

B CB XB x1 x2 x3 S1 S2 MinRatio

S1 0 10 1 0 -1 1 0

x2 0 10 0 1 1 0 -1

Z=0 Zj 0 0 0 0 0

Cj - Zj 0 0 0 0 0

Since all C j - Z j ≥ 0

Hence, optimal solution is arrived with value of variables as :

x 1 = 0, x 2 = 10, x 3 = 0

Min Z = 0

-->Phase-2<--

we eliminate the artificial variables and change the objective function for the original,
Iteration-1 Cj 5 2 10 0 0

B CB XB x1 x2 x3 S1 S2 MinRatio

S1 0 10 1 0 -1 1 0

x2 2 10 0 1 1 0 -1

Z = 20 Zj 0 2 2 0 -2

Cj - Zj 5 0 8 0 2

Since all C j - Z j ≥ 0

Hence, optimal solution is arrived with value of variables as :

x 1 = 0, x 2 = 10, x 3 = 0

Min Z = 20

This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here

1. Algorithm & Example-1 3. Ex

(Previous example) (Next ex

https://cbom.atozmath.com/example/CBOM/Simplex.aspx?q=tp&q1=E2 2/3
3/19/25, 9:29 PM Two-Phase method Example-2

Sider: Free ChatGPT translator

Sider -- ChatGPT, GPT-4, Draw & Web access

Share this solution or page with your friends.

Home What's new College Algebra Games

Copyright © 2025. All rights reserved. Terms, Privacy

.
.

https://cbom.atozmath.com/example/CBOM/Simplex.aspx?q=tp&q1=E2 3/3