Max Z = 8 x1 + 12 x2
Restricciones:
4 x1 + 10 x2 ≤ 54
1 x1 + 1 x2 ≤ 9
x1 , x2 ≥ 0
A(0;5.4)=64.8
B(0,0)=0
C(9;0)=72
D(6;3)=84
Pendientes :
8 x1 + 12 x2 = L1= -2/3
4 x1 + 10 x2 ≤ 54 = L2= -2/5
1 x1 + 1 x2 ≤ 9 =L3= -1
Función Objetivo:
Max Z = C1 x1 + C2 x2
¿ Sensibilidad del C1? = Max Z = C1 x1 + 12 x2 …. Estoy formando una nueva ecuación FO.
L1= -C1/12
L3<= L1<= L2
-1<= -c1/12<=-2/5
4.8<=c1<=12
¿ Sensibilidad del C2? = Max Z = 8 x1 + C2 x2 …. Estoy formando una nueva ecuación FO.
L1= -8/C2
L3<= L1<= L2
-1<= -8/c2<=-2/5
8<=c2<=20
4 x1 + 10 x2 ≤ B1 = A( 9;0) B (0;9)
36<=B1<=90 = [36;90]
1 x1 + 1 x2 ≤ B2 = C(0;5.4) D(13.5;0)
Ctrl + R
max=13*x1+13.5*x2;
3*x1+2*x2<=500;
x1+1.5*x2<=100;
x1+x2<=85;
x1<=57;
x2=28
Global optimal solution found.
Objective value: 2622.414
Infeasibilities: 0.000000
Total solver iterations: 3
Elapsed runtime seconds: 0.13
Model Class: LP
Total variables: 8
Nonlinear variables: 0
Integer variables: 0
Total constraints: 5
Nonlinear constraints: 0
Total nonzeros: 24
Nonlinear nonzeros: 0
Variable Value
Reduced Cost
DISPO( L1) 5000.000
0.000000
DISPO( L2) 3000.000
0.000000
COSTO( L1) 0.4500000
0.000000
COSTO( L2) 0.2500000
0.000000
PRODMIN( YOGURT) 200.0000
0.000000
PRODMIN( LECHESAB) 500.0000
0.000000
PRECIO( YOGURT) 1.050000
0.000000
PRECIO( LECHESAB) 0.9500000
0.000000
REQUERIM( L1, A, YOGURT) 1.500000
0.000000
REQUERIM( L1, A, LECHESAB) 1.800000
0.000000
REQUERIM( L1, B, YOGURT) 1.600000
0.000000
REQUERIM( L1, B, LECHESAB) 1.500000
0.000000
REQUERIM( L2, A, YOGURT) 1.900000
0.000000
REQUERIM( L2, A, LECHESAB) 1.600000
0.000000
REQUERIM( L2, B, YOGURT) 1.450000
0.000000
REQUERIM( L2, B, LECHESAB) 1.700000
0.000000
X( L1, A, YOGURT) 4250.000
0.000000
X( L1, A, LECHESAB) 0.000000
0.1166667
X( L1, B, YOGURT) 0.000000
0.4375000E-01
X( L1, B, LECHESAB) 750.0000
0.000000
X( L2, A, YOGURT) 0.000000
0.1715064
X( L2, A, LECHESAB) 0.000000
0.6788793E-01
X( L2, B, YOGURT) 3000.000
0.000000
X( L2, B, LECHESAB) 0.000000
0.1064909