Caso de programacion lineal
Enviado por fedebac • 21 de Octubre de 2016 • Informe • 8.208 Palabras (33 Páginas) • 306 Visitas
Caso de programación lineal
Modelo matemático
- Variables
X, y
Utilidad = 20000x + 15000y
Restricciones
X=> 0
y=>0
3x+2y<=120
X+2y<=80
Modelo lingo
max= 20000*x + 15000*y;
0<=x;
0<=y ;
3*x+2*y<=120;
X+2*y<=80;
Global optimal solution found.
Objective value: 850000.0
Total solver iterations: 2
Variable Value Reduced Cost
X 20.00000 0.000000
Y 30.00000 0.000000
Row Slack or Surplus Dual Price
1 850000.0 1.000000
2 20.00000 0.000000
3 30.00000 0.000000
4 0.000000 6250.000
5 0.000000 1250.000
- Modelo matemático
Variables: X,Y utilidad: 10%X + 7%Y
Restricciones:
X=>0 , Y>=0 , X+ Y<=10 , x<=6 , y>=2 , x>=y
Modelo lingo
max=0.1*X +0.07*Y;
0<=x;
0<=y;
X+ Y<=10;
x<=6;
y>=2;
x>=y;
Global optimal solution found.
Objective value: 0.8800000
Total solver iterations: 2
Variable Value Reduced Cost
X 6.000000 0.000000
Y 4.000000 0.000000
Row Slack or Surplus Dual Price
1 0.8800000 1.000000
2 6.000000 0.000000
3 4.000000 0.000000
4 0.000000 0.7000000E-01
5 0.000000 0.3000000E-01
6 2.000000 0.000000
7 2.000000 0.000000
- Modelo matemático
Variables: X,Y
Utilidad: 5X+ 7Y
Restricciones;
0<=x , 0<=y , X<=120 , X+Y<=150
Modelo lingo
max=5*X+ 7*Y;
0<=x ;
0<=y ;
X<=120;
X+Y<=150;
Global optimal solution found.
Objective value: 1050.000
Total solver iterations: 0
Variable Value Reduced Cost
X 0.000000 2.000000
Y 150.0000 0.000000
Row Slack or Surplus Dual Price
1 1050.000 1.000000
2 0.000000 0.000000
3 150.0000 0.000000
4 120.0000 0.000000
5 0.000000 7.000000
- Modelo matemático
Variables: X,Y
Utilidad: 8X + 10Y
Restricciones: 0<=X , 0<=y , 5x+8Y<=50000 , X+Y<=700
Modelo lingo
max=8*X + 10*Y;
0<=X;
0<=y;
5*x+8*Y<=50000;
X+Y<=700;
Global optimal solution found.
Objective value: 7000.000
Total solver iterations: 3
Variable Value Reduced Cost
X 0.000000 2.000000
Y 700.0000 0.000000
Row Slack or Surplus Dual Price
1 7000.000 1.000000
2 0.000000 0.000000
3 700.0000 0.000000
4 44400.00 0.000000
5 0.000000 10.00000
- Modelo matemático:
Variables; X , Y
Utilidad : 1X+1Y
Restricciones: 0<=x , 0<=y , X+2Y<=80 , 3X+2y<=120
Modelo lingo
max= X+Y;
0<=x;
0<=y;
X+2*Y<=80;
3*X+2*y<=120;
Global optimal solution found.
Objective value: 50.00000
Total solver iterations: 2
Variable Value Reduced Cost
X 20.00000 0.000000
...