Scribd
Upload
28 views3 pages

Linear Program - Original Data Linear Program - Original Data

This document contains the output of an optimization problem solved using the simplex method. It gives the original linear program data defining the objective function and constraints. It then shows the initial basic feasible solution and several simplex tableaus showing the iterations of the algorithm as it arrives at the optimal solution.

Uploaded by

vsyoi
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
28 views3 pages

Linear Program - Original Data Linear Program - Original Data

This document contains the output of an optimization problem solved using the simplex method. It gives the original linear program data defining the objective function and constraints. It then shows the initial basic feasible solution and several simplex tableaus showing the iterations of the algorithm as it arrives at the optimal solution.

Uploaded by

vsyoi
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 2.

00
Copyright 2000-2007 Hamdy A. Taha. All Rights Reserved
Friday, August 18, 2017 13:20

LINEAR PROGRAM -- ORIGINAL DATA

Title: Min

x1 x2
Maximize 5.00 3.00
Subject to
( 1) 2.00 4.00 <= 12.00
( 2) 2.00 0.00 = 10.00
( 3) 5.00 2.00 >= 20.00

Lower Bound 0.00 0.00


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

Title: Min

Iteration 1
Basic x1 x2 Sx3 sx4 Rx5 Rx6
z (max) -7005.00 -2003.00 1000.00 0.00 0.00 0.00
sx4 2.00 4.00 0.00 1.00 0.00 0.00
Rx5 2.00 0.00 0.00 0.00 1.00 0.00
Rx6 5.00 2.00 -1.00 0.00 0.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) -30000.00
sx4 12.00
Rx5 10.00
Rx6 20.00

Iteration 2
Basic x1 x2 Sx3 sx4 Rx5 Rx6
z (max) 0.00 799.00 -401.00 0.00 0.00 1401.00
sx4 0.00 3.20 0.40 1.00 0.00 -0.40
Rx5 0.00 -0.80 0.40 0.00 1.00 -0.40
x1 1.00 0.40 -0.20 0.00 0.00 0.20
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) -1980.00
sx4 4.00
Rx5 2.00
x1 4.00

Iteration 3
Basic x1 x2 Sx3 sx4 Rx5 Rx6
z (max) 0.00 -3.00 0.00 0.00 1002.50 1000.00
sx4 0.00 4.00 0.00 1.00 -1.00 0.00
Sx3 0.00 -2.00 1.00 0.00 2.50 -1.00
x1 1.00 0.00 0.00 0.00 0.50 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) 25.00
sx4 2.00
Sx3 5.00
x1 5.00
Iteration 4
Basic x1 x2 Sx3 sx4 Rx5 Rx6
z (max) 0.00 0.00 0.00 0.75 1001.75 1000.00
x2 0.00 1.00 0.00 0.25 -0.25 0.00
Sx3 0.00 0.00 1.00 0.50 2.00 -1.00
x1 1.00 0.00 0.00 0.00 0.50 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (y/n)? n n

Basic Solution
z (max) 26.50
x2 0.50
Sx3 6.00
x1 5.00

You might also like