LISTA DE REVISO 25/11/15

EXERCICIO 1.

Min = 4*d11 + 2*d12+5*d13+11*d21+7*d22+4*d23;

!restries;
D11+d12+d13=800;
D21+d22+d23=1000;
D11+d21=500;
D12+d22=400;
D13+d23=900;
Global optimal solution found.
Objective value:
6900.000
Infeasibilities:
0.000000
Total solver iterations:
1
Elapsed runtime seconds:
0.49
Model Class:

LP

Total variables:
Nonlinear variables:
Integer variables:

Total constraints:
Nonlinear constraints:

Total nonzeros:
Nonlinear nonzeros:

18

Variable
D11

0
0

Value
500.0000

Reduced Cost
0.000000

D12
D13
D21
D22
D23
Row
1
2
3
4
5
6

300.0000
0.000000
0.000000
100.0000
900.0000

0.000000
6.000000
2.000000
0.000000
0.000000

Slack or Surplus
Dual Price
6900.000
-1.000000
0.000000
0.000000
0.000000
-5.000000
0.000000
-4.000000
0.000000
-2.000000
0.000000
1.000000

EXERCICIO 2.

Min=
48*a1+48*a2+50*a3+44*a4+56*b1+60*b2+60*b3+68*b4+96*c1+94*c2+90*c3+85*c4+42*d1+44*d2+
54*d3+46*d4;
!restries;
@bin(A1);
@bin(a2);
@bin(a3);
@bin(a4);
@bin(b1);
@bin(b2);
@bin(b);
@bin(b4);
@bin(c1);
@bin(c2);
@bin(c3);
@bin(c4);
@bin(d1);
@bin(d2);
@bin(d3);
@bin(d4);

a1+a2+a3+a4=1;
b1+b2+b3+b4=1;
c1+c2+C3+c4=1;
d1+d2+d3+D4=1;
a1+b1+c1+d1=1;
a2+b2+c2+d2=1;
a3+b3+c3+d3=1;
a4+b4+c4+d4=1;

Global optimal solution found.

Objective value:
234.0000
Objective bound:
234.0000
Infeasibilities:
0.000000
Extended solver steps:
0
Total solver iterations:
0
Elapsed runtime seconds:
0.48
Model Class:

MILP

Total variables:
Nonlinear variables:
Integer variables:

17
0
16

Total constraints:
Nonlinear constraints:

Total nonzeros:
Nonlinear nonzeros:

48

Variable
A1
A2
A3
A4
B1
B2
B3
B4
C1
C2
C3
C4
D1
D2
D3
D4
B

Value
0.000000
0.000000
0.000000
1.000000
1.000000
0.000000
0.000000
0.000000
0.000000
0.000000
1.000000
0.000000
0.000000
1.000000
0.000000
0.000000
0.000000

Reduced Cost
48.00000
48.00000
50.00000
44.00000
-4.000000
0.000000
0.000000
8.000000
96.00000
94.00000
90.00000
85.00000
42.00000
44.00000
54.00000
46.00000
0.000000

Row
1
2
3
4
5
6
7
8
9

Slack or Surplus
Dual Price
234.0000
-1.000000
0.000000
0.000000
0.000000
-60.00000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000

EXERCICIO 3.

MIN = D*C + (D/Q)* S + (Q/T) * cM;

D= demanda anual;
C= custo unitrio;
Q= quantidade por pedido;
Cm= custo unitrio de manuteno de estoque;
S= custo unitrio de pedir
T= tempo

MIN =2000*25+ (2000/Q)*60+(Q/2)*12;

Local optimal solution found.

Objective value:
51697.06
Infeasibilities:
0.000000
Extended solver steps:
5
Best multistart solution found at step:
1
Total solver iterations:
45
Elapsed runtime seconds:
2.74
Model Class:

NLP

Total variables:
Nonlinear variables:
Integer variables:

Total constraints:
Nonlinear constraints:

1
0

Total nonzeros:
Nonlinear nonzeros:

1
1

Variable
Value
Q
141.4214
Row
1

Reduced Cost
0.000000

Slack or Surplus
Dual Price
51697.06
-1.000000

EXERCICIO 4.

Max= (-0.3*(x^2) ) (0.5 * (x)*(y))- (0.4* (y^2))+85*x +125y -2500;

!restries;
X+y<=30000;
Global optimal solution found.
Objective value:
7347.826
Infeasibilities:
0.000000
Total solver iterations:
9
Elapsed runtime seconds:
0.48
Model is convex quadratic
Model Class:

QP

Total variables:
Nonlinear variables:
Integer variables:

Total constraints:
Nonlinear constraints:

Total nonzeros:
Nonlinear nonzeros:

Variable

2
0

Value

Reduced Cost

X
Y
Row
1
2

23.91305
141.3043

0.8312832E-06
0.1186553E-06

Slack or Surplus
Dual Price
7347.826
1.000000
29834.78
0.000000

EXERCICIO 5.

Max=(20*(x^(3/2))*y);
!restries;
X+y<=60000;
Local optimal solution found.
Objective value:
0.3278649E+13
Infeasibilities:
0.000000
Extended solver steps:
5
Best multistart solution found at step:
1
Total solver iterations:
42
Elapsed runtime seconds:
2.62
Model Class:

NLP

Total variables:
Nonlinear variables:
Integer variables:

Total constraints:
Nonlinear constraints:

Total nonzeros:
Nonlinear nonzeros:

2
0
1
2

Variable
Value
X
36000.00
Y
24000.00

Reduced Cost
0.000000
0.000000

Row Slack or Surplus

Dual Price
1
0.3278649E+13
1.000000
2
0.000000
0.1366104E+09