PESQUISA OPERACIONAL II

LISTA DE EXERCICIOS LINGO 4/11/14

Grupo 7

EX 1:

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

D= demanda anual;
C= custo unitrio;
Q= quantidade por pedido;
Cm= custo unitrio de manuteno de estoque;
S= custo unitrio de pedir
Min=100*100 + (100/Q)*100+(Q/31)*0.02;
Local optimal solution found.
Objective value:
Infeasibilities:
Extended solver steps:
Best multistart solution found at step:
Total solver iterations:
Elapsed runtime seconds:
Model Class:

NLP

Total variables:
Nonlinear variables:
Integer variables:

1
1
0

Total constraints:
Nonlinear constraints:

1
1

Total nonzeros:
Nonlinear nonzeros:

1
1

Reduced Cost
0.000000

Variable

Value

3937.004

Row
Price
-1.000000

EX 2:

10005.08
0.000000
5
1
45
3.99

Slack or Surplus
10005.08

Dual

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=20000*8 + (20000/Q)*5+(Q/2)*20;
!restries;
[r1] q<=30;
Local optimal solution found.
Objective value:
Infeasibilities:
Extended solver steps:
Best multistart solution found at step:
Total solver iterations:
Elapsed runtime seconds:
Model Class:

NLP

Total variables:
Nonlinear variables:
Integer variables:

1
1
0

Total constraints:
Nonlinear constraints:

2
1

Total nonzeros:
Nonlinear nonzeros:

2
1

Reduced Cost

163633.3
0.000000
5
1
20
3.26

Variable

Value

30.00000

-101.1111
Price
-1.000000
0.000000

EX 3:

Row

Slack or Surplus

163633.3

R1

0.000000

Dual

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 (365/t)
Min=50*32 + (50/Q)*20+(Q/53)*0,35;
Local optimal solution found.
Objective value:
Infeasibilities:
Extended solver steps:
Best multistart solution found at step:
Total solver iterations:
Elapsed runtime seconds:
Model Class:

NLP

Total variables:
Nonlinear variables:
Integer variables:

1
1
0

Total constraints:
Nonlinear constraints:

1
1

Total nonzeros:
Nonlinear nonzeros:

1
1

Reduced Cost
-0.6068923E-08

Variable

Value

389.1381

Row
Price
-1.000000

EX 4:

1605.140
0.000000
5
1
42
3.98

Slack or Surplus
1605.140

Dual

Oferta: somatrio xij = capacidade de oferta- somatrio da demanda

Oferta=somatrio de oferta + somatrio de demanda
Demanda : somatrio das demanda = d somatrio das ofertas

Min = 2*ab + 4*ac + 9*ad +3*de + 2*ed;

!sujeito a ;
Ab+ac+ad<=60;
-ab + bc <=50;
-ac-bc+ce=0;
-ad-ed+ed=30;
-ce-de+ed=60;
Ab<=10;
Ce<=80;
No feasible solution found.
Infeasibilities:
Total solver iterations:
Elapsed runtime seconds:

30.00000
0
4.33

Model Class:

LP

Total variables:
Nonlinear variables:
Integer variables:

7
0
0

Total constraints:
Nonlinear constraints:

8
0

Total nonzeros:
Nonlinear nonzeros:

19
0

Reduced Cost
2.000000
4.000000
9.000000
5.000000
0.000000
0.000000

Variable

Value

AB

0.000000

AC

0.000000

AD

0.000000

DE

0.000000

ED

60.00000

BC

0.000000

CE

0.000000

Row

Slack or Surplus

2.000000
Price
-1.000000
0.000000
0.000000
0.000000
0.000000
-2.000000
0.000000
0.000000

EX 5:

Max = x46 + x56;

!restries;
X12-x23-x25-x24=0;
X13+x23-x34-x35=0;

30.00000

60.00000

50.00000

0.000000

-30.00000

0.000000

10.00000

80.00000

Dual

X24+x34+x54-x46=0;
X35+x25-x54-x56=0
!capacidades;
x12<=6;
x13<=8;
x24<=4;
x23<=2;
x25<=1;
x34<=5;
x54<=4;
x46<=8;
x56<=9;
Global optimal solution found.
Objective value:
Infeasibilities:
Total solver iterations:
Elapsed runtime seconds:

15.00000
0.000000
4
0.57

Model Class:

LP

Total variables:
Nonlinear variables:
Integer variables:

10
0
0

Total constraints:
Nonlinear constraints:

14
0

Total nonzeros:
Nonlinear nonzeros:

27
0

Reduced Cost
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
Price
1.000000
0.000000
-1.000000

Variable

Value

X46

6.000000

X56

9.000000

X12

3.000000

X23

2.000000

X25

1.000000

X24

4.000000

X13

8.000000

X34

2.000000

X35

8.000000

X54

0.000000

Row

Slack or Surplus

15.00000

0.000000

0.000000

Dual

-1.000000
-1.000000
0.000000
1.000000
1.000000
1.000000
1.000000
0.000000
0.000000
0.000000
0.000000

0.000000

0.000000

3.000000

0.000000

0.000000

0.000000

10

0.000000

11

3.000000

12

4.000000

13

2.000000

14

0.000000