Desarrollo
Pregunta
1
Max =100*x1+120*x2;
8*(2*x1+4*x2)<=48;
4 *(4*x1+2*x2)<=63 ;
2*(4*x1+4*x2)<=32;
Rows= 4 Vars= 2 No. integer vars= 0
( all are linear)
Nonzeros=
11 Constraint nonz= 6( 0 are +- 1) Density=0.917
Smallest and largest elements in absolute
value= 8.00000 120.000
No. < :
3 No. =: 0 No. > : 0, Obj=MAX, GUBs <= 1
Single cols=
0
Optimal solution found at step: 1
Objective value: 300.0000
Variable Value Reduced Cost
X1 3.000000 0.0000000E+00
X2 0.0000000E+00 80.00000
Row
Slack or Surplus Dual Price
1 300.0000 1.000000
2 0.0000000E+00 6.250000
3 15.00000 0.0000000E+00
4 8.000000 0.0000000E+00
Ranges in which the basis is unchanged:
Objective
Coefficient Ranges
Current Allowable Allowable
Variable Coefficient Increase Decrease
X1 100.0000 INFINITY 40.00000
X2 120.0000 80.00000 INFINITY
Righthand Side Ranges
Row Current Allowable Allowable
RHS Increase Decrease
2 48.00000 15.00000 48.00000
3 63.00000 INFINITY 15.00000
4 32.00000 INFINITY 8.000000
No hay comentarios:
Publicar un comentario