TORA Optimization System, Windows-version 2.

00
Copyright 2000-2007 Hamdy A. Taha. All Rights Reserved
Monday, September 22, 2014 10:56

LINEAR PROGRAM -- ORIGINAL DATA

Title:

Maximize
Subject to
( 1)
( 2)
Lower Bound
Upper Bound
Unrestr'd (y/n)?

x
x1
3.00

y
x2
2.00

z
x3
2.00

2.00
2.00

1.00
2.00

3.00
2.00

0.00
infinity
n

0.00
infinity
n

0.00
infinity
n

<=
<=

3.00
7.00

SIMPLEX TABLEAUS -- (Starting All-Slack Method)

Title:

Iteration 1
Basic
z (max)
sx4
sx5
Lower Bound
Upper Bound
Unrestr'd (y/n)?

x
x1
-3.00
2.00
2.00
0.00
infinity
n

y
x2
-2.00
1.00
2.00
0.00
infinity
n

z
x3
-2.00
3.00
2.00
0.00
infinity
n

Iteration 2
Basic
z (max)
x1
sx5
Lower Bound
Upper Bound
Unrestr'd (y/n)?

x
x1
0.00
1.00
0.00
0.00
infinity
n

y
x2
-0.50
0.50
1.00
0.00
infinity
n

z
x3
2.50
1.50
-1.00
0.00
infinity
n

Iteration 3
Basic
z (max)
x2
sx5
Lower Bound
Upper Bound
Unrestr'd (y/n)?

x
x1
1.00
2.00
-2.00
0.00
infinity
n

y
x2
0.00
1.00
0.00
0.00
infinity
n

z
x3
4.00
3.00
-4.00
0.00
infinity
n

sx4
0.00
1.00
0.00

sx5
0.00
0.00
1.00

Solution
0.00
3.00
7.00

sx4
1.50
0.50
-1.00

sx5
0.00
0.00
1.00

Solution
4.50
1.50
4.00

sx4
2.00
1.00
-2.00

sx5
0.00
0.00
1.00

Solution
6.00
3.00
1.00