Scribd
Upload
97 views9 pages

LP Optimum Found at Step 0

The document describes the results of two iterations of an optimization problem solved using the simplex method. In the first iteration, variables X1, X2, and X3 are in the basis with an objective value of 76.6666. In the second iteration, variables Y1, Y2, and Y3 are in the basis with the same objective value found. The reduced costs and allowable coefficient and right-hand side ranges are also provided.

Uploaded by

Erik Eduard Romaní Chávez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
97 views9 pages

LP Optimum Found at Step 0

The document describes the results of two iterations of an optimization problem solved using the simplex method. In the first iteration, variables X1, X2, and X3 are in the basis with an objective value of 76.6666. In the second iteration, variables Y1, Y2, and Y3 are in the basis with the same objective value found. The reduced costs and allowable coefficient and right-hand side ranges are also provided.

Uploaded by

Erik Eduard Romaní Chávez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE


1) 76.66666
VARIABLE VALUE REDUCED COST
X1 0.000000 1.833333
X2 6.666667 0.000000
X3 16.666666 0.000000

ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 0.833333
3) 0.000000 0.666667
4) 26.666666 0.000000
NO. ITERATIONS= 0
RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X1 2.000000 1.833333 INFINITY
X2 4.000000 2.000000 2.500000
X3 3.000000 5.000000 1.000000

RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 60.000000 39.999996 19.999998
3 40.000000 19.999998 24.999998
4 80.000000 INFINITY 26.666666

THE TABLEAU
ROW (BASIS) X1 X2 X3 SLK 2 SLK 3
1 ART 1.833 0.000 0.000 0.833 0.667
2 X2 0.333 1.000 0.000 0.333 -0.333
3 X3 0.833 0.000 1.000 -0.167 0.667
4 SLK 4 -1.667 0.000 0.000 -0.667 -0.333
ART ART 1.833 0.000 0.000 0.833 0.667

ROW SLK 4
1 0.000 76.667
2 0.000 6.667
3 0.000 16.667
4 1.000 26.667
ART 0.000 0.000



Minimoooo





LP OPTIMUM FOUND AT STEP 2

OBJECTIVE FUNCTION VALUE
1) 76.66666
VARIABLE VALUE REDUCED COST
Y1 0.833333 0.000000
Y2 0.666667 0.000000
Y3 0.000000 26.666666
ROW SLACK OR SURPLUS DUAL PRICES
2) 1.833333 0.000000
3) 0.000000 -6.666667
4) 0.000000 -16.666666
NO. ITERATIONS= 2
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
Y1 60.000000 40.000004 19.999998
Y2 40.000000 19.999998 24.999998
Y3 80.000000 INFINITY 26.666668
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 2.000000 1.833333 INFINITY
3 4.000000 2.000000 2.500000
4 3.000000 5.000000 1.000000
THE TABLEAU
ROW (BASIS) Y1 Y2 Y3 SLK 2 SLK 3
1 ART 0.000 0.000 26.667 0.000 6.667
2 SLK 2 0.000 0.000 1.667 1.000 -0.333
3 Y2 0.000 1.000 0.333 0.000 0.333
4 Y1 1.000 0.000 0.667 0.000 -0.333 LP OPTIMUM FOUND AT STEP 2

OBJECTIVE FUNCTION VALUE

1) 76.66666

VARIABLE VALUE REDUCED COST
Y1 0.833333 0.000000
Y2 0.666667 0.000000
Y3 0.000000 26.666666


ROW SLACK OR SURPLUS DUAL PRICES
2) 1.833333 0.000000
3) 0.000000 -6.666667
4) 0.000000 -16.666666

NO. ITERATIONS= 2


RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
Y1 60.000000 40.000004 19.999998
Y2 40.000000 19.999998 24.999998
Y3 80.000000 INFINITY 26.666668

RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 2.000000 1.833333 INFINITY
3 4.000000 2.000000 2.500000
4 3.000000 5.000000 1.000000

THE TABLEAU
ROW (BASIS) Y1 Y2 Y3 SLK 2 SLK 3
1 ART 0.000 0.000 26.667 0.000 6.667
2 SLK 2 0.000 0.000 1.667 1.000 -0.333
3 Y2 0.000 1.000 0.333 0.000 0.333
4 Y1 1.000 0.000 0.667 0.000 -0.333


ROW SLK 4
1 16.667 -76.667
2 -0.833 1.833
3 -0.667 0.667
4 0.167 0.833

ROW SLK 4
1 16.667 -76.667
2 -0.833 1.833
3 -0.667 0.667
4 0.167 0.833




















La primera variable que entrara es x2, ya que su celda de la ultima la es la que valor m asbajo
tiene. Por el metodo del cociente m nimo, la variable que sale es x4, ya que 15 <26;666 < 40

You might also like