Scribd
Upload
32 views36 pages

Método Simplex

The document describes the simplex method for solving linear programming problems. It shows the tabular format for implementing the simplex method, with columns for the objective function coefficients, basic and non-basic variables, right-hand side values, and reduced costs. It provides an example problem and shows the steps of the simplex method to arrive at the optimal solution through iterations where variables enter or leave the basis.

Uploaded by

Oscar Sotomayor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
32 views36 pages

Método Simplex

The document describes the simplex method for solving linear programming problems. It shows the tabular format for implementing the simplex method, with columns for the objective function coefficients, basic and non-basic variables, right-hand side values, and reduced costs. It provides an example problem and shows the steps of the simplex method to arrive at the optimal solution through iterations where variables enter or leave the basis.

Uploaded by

Oscar Sotomayor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 36

Simplex method

Manufacturing Processes
RESUMEN

El método gráfico puede ser usado solo con 2 dos 3 variables.


El método algebraico evalúa un gran número de opciones incluyendo las opciones
no factibles.
Necesitamos un método que:
Evalúe solo soluciones factibles.
Evalúe soluciones cada vez mejores mientras el método progresa.
Se detenga cuando alcanzamos la solución optima. (antes de evaluar todas las
soluciones factibles)
Maximize Z=5X1+12X2+0X3+0X4
Subject to 10X1 + 20X2 + X3= 100
8X1+7X2 +X4 = 56
X1, X2 , X3, X4 ≥ 0

N° Variables Solved Variables Fixed to zero Solution Objective Comments


(Basic Variables) (non Basic Variables)

1 X1; X2 X3=0 ; X4=0 X1=4,67 Z=55,39 Basic Feasible


X2=2,67
2 X1; X3 X2=0 ; X4=0 X1=7 Z=35 Basic Feasible
X3=30
3 X1; X4 X2=0 ; X3=0 X1=10 Infeasible
X4=-24
4 X2; X3 X1=0 ; X4=0 X2=8 Infeasible
X3=-60
5 X2; X4 X1=0 ; X3=0 X2=5 Z=60 Optimum feasible
X4=21
6 X3; X4 X2=0 ; X1=0 X3=100 Z=0 Basic Feasible
X4=56
Maximize Z=5X1+12X2

Subject to 10X1 + 20X2 ≤ 100


8X1+7X2 ≤ 56
X1, X2 ≥ 0

Maximize Z=5X1+12X2+0X3+0X4
Subject to 10X1 + 20X2 + X3= 100
8X1+7X2 +X4 = 56
X1, X2 , X3, X4 ≥ 0
Maximize Z=5X1+12X2+0X3+0X4
Subject to 10X1 + 20X2 + X3= 100
8X1+7X2 +X4 = 56
X1, X2 , X3, X4 ≥ 0
Let´s start with X3 and X4 as basic variables and X1 and X2 as
non basic

Express as a function of non basic


X3= 100 – 10X1-20X2
X4 = 56 – 8X1 -7X2
Z=5X1+12X2
Express as a function of non basic
X3= 100 – 10X1-20X2
X4 = 56 – 8X1 -7X2
Z=5X1+12X2

Enter X2 since it has the higher coefficient


As X2 approx. to 5 X3 goes to zero
X3 replaces X2 as non basic variable
X2 and X4 as basic variables and X1 and X3 as non basic
Express as a function of non basic
X2= 5 – ½ X1- 1/20 X3
Final solution
X4 = 21 – 9/2 X1 -7/20 X3
Z=60 -X1- 3/5X3
Exercise
Solution
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
10 20 1 0 100
8 7 0 1 56
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
X3 10 20 1 0 100
X4 8 7 0 1 56
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi 5
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi 5 12
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi 5 12 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi 5 12 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi 5 12 0 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100
0 X4 8 7 0 1 56
Ci-Zi 5 12 0 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56
Ci-Zi 5 12 0 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0
Simple Method – tabular
form

5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
X2
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
X2
X4
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
X2 1/2 1 1/20 0 5
X4
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
X2 1/2 1 1/20 0 5
X4 9/2 0 -7/20 1 21
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
12 X2 1/2 1 1/20 0 5
0 X4 9/2 0 -7/20 1 21
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
12 X2 1/2 1 1/20 0 5
0 X4 9/2 0 -7/20 1 21
Ci-Zi
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
12 X2 1/2 1 1/20 0 5
0 X4 9/2 0 -7/20 1 21
Ci-Zi -1 0 -3/5 0
5 12 0 0
CB XB X1 X2 X3 X4 RHS θ
0 X3 10 20 1 0 100 5
0 X4 8 7 0 1 56 8
Ci-Zi 5 12 0 0 0

CB XB X1 X2 X3 X4 RHS θ
12 X2 1/2 1 1/20 0 5
0 X4 9/2 0 -7/20 1 21
Ci-Zi -1 0 -3/5 0 60
Exercise
Solution

You might also like