Scribd
Upload
30 views3 pages

VB Tora 98

This document describes the results of running a linear programming solver on a twophase optimization problem. It shows the initial constraints and objectives, then displays the outputs of multiple simplex iterations in phase 1 and phase 2 of the two-phase method to arrive at an optimal solution.

Uploaded by

Yandi
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
30 views3 pages

VB Tora 98

This document describes the results of running a linear programming solver on a twophase optimization problem. It shows the initial constraints and objectives, then displays the outputs of multiple simplex iterations in phase 1 and phase 2 of the two-phase method to arrive at an optimal solution.

Uploaded by

Yandi
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/ 3

TORA Optimization System, Windows®-version 1.

00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
Thursday, July 21, 2022 9:16

LINEAR PROGRAM -- ORIGINAL DATA

Title: twophase

x1 x2
x1 x2
Minimize 4.00 1.00
Subject to
( 1) 3.00 1.00 = 3.00
( 2) 4.00 3.00 >= 6.00
( 3) 1.00 2.00 <= 4.00

Lower Bound 0.00 0.00


Upper Bound infinity infinity
Unrestr'd (y/n)? n n
SIMPLEX TABLEAUS -- (Two-Phase Method)

Title: twophase

Phase 1 (Iter 1 x1 x2
Basic x1 x2 Sx3 Rx4
z (min) 7.00 4.00 -1.00 0.00
Rx4 3.00 1.00 0.00 1.00
Rx5 4.00 3.00 -1.00 0.00
sx6 1.00 2.00 0.00 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution


z (min) 0.00 0.00 9.00
Rx4 0.00 0.00 3.00
Rx5 1.00 0.00 6.00
sx6 0.00 1.00 4.00

Phase 1 (Iter 2 x1 x2
Basic x1 x2 Sx3 Rx4
z (min) 0.00 1.67 -1.00 -2.33
x1 1.00 0.33 0.00 0.33
Rx5 0.00 1.67 -1.00 -1.33
sx6 0.00 1.67 0.00 -0.33
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution


z (min) 0.00 0.00 2.00
x1 0.00 0.00 1.00
Rx5 1.00 0.00 2.00
sx6 0.00 1.00 3.00

Phase 1 (Iter 3 x1 x2
Basic x1 x2 Sx3 Rx4
z (min) 0.00 0.00 0.00 -1.00
x1 1.00 0.00 0.20 0.60
x2 0.00 1.00 -0.60 -0.80
sx6 0.00 0.00 1.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution


z (min) -1.00 0.00 0.00
x1 -0.20 0.00 0.60
x2 0.60 0.00 1.20
sx6 -1.00 1.00 1.00
Phase 2 (Iter 4 x1 x2
Basic x1 x2 Sx3 Rx4
z (min) 0.00 0.00 0.20 blocked
x1 1.00 0.00 0.20 0.60
x2 0.00 1.00 -0.60 -0.80
sx6 0.00 0.00 1.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution


z (min) blocked 0.00 3.60
x1 -0.20 0.00 0.60
x2 0.60 0.00 1.20
sx6 -1.00 1.00 1.00

Phase 2 (Iter 5 x1 x2
Basic x1 x2 Sx3 Rx4
z (min) 0.00 0.00 0.00 blocked
x1 1.00 0.00 0.00 0.40
x2 0.00 1.00 0.00 -0.20
Sx3 0.00 0.00 1.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Rx5 sx6 Solution


z (min) blocked -0.20 3.40
x1 0.00 -0.20 0.40
x2 0.00 0.60 1.80
Sx3 -1.00 1.00 1.00

You might also like