Tugas 2

Riset
Operasional
CHIKA OLVIANI
2110100072

1.
Keterangan
Fi= profit untuk project i (i=1,2,3,4,5,6,7,8)
Max = 2.1*F1+0.5*F2+3.0*F3+2.0*F4+1.0*F5+1.5*F6+0.6*F7+1.8*F8;
s.t
F1+F2+F3+F4+F5+F6+F7+F8 >= 3;
F3+F4+F5+F8 >= 1;
550*F1+400*F2+300*F3+350*F4+450*F5+500*F6+350*F7+200*F8 <= 2400;
200*F1+150*F2+400*F3+450*F4+300*F5+150*F6+200*F7+600*F8 <= 1000;
@Bin(F1);
@Bin(F2);
@Bin(F3);
@Bin(F4);
@Bin(F5);
@Bin(F6);
@Bin(F7);
@Bin(F8);
Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

7.200000
7.200000
0.000000
0
0

Model Class:

PILP

Total variables:
Nonlinear variables:
Integer variables:

8
0
8

Total constraints:
Nonlinear constraints:

5
0

Total nonzeros:
Nonlinear nonzeros:
Cost
-2.100000
-0.5000000
-3.000000
-2.000000
-1.000000
-1.500000
-0.6000000
-1.800000

36
0
Variable

Value

F1

1.000000

F2

0.000000

F3

1.000000

F4

0.000000

F5

0.000000

F6

1.000000

F7

1.000000

F8

0.000000

Reduced

Row

Price
1.000000
0.000000
0.000000
0.000000
0.000000

2.

Slack or Surplus

7.200000

1.000000

0.000000

700.0000

50.00000

Dual

Constrain a : z1+z2+z3+z4+z5+z6+z7+z8 = 3
Constrain b : z1+z2+z3+z4+z5 2
Constrain c : z3 = 0
Z8 = 0
Constrain d : x4-x1 0

3.
Keterangan :
A0i = Asisten 0 mengerjakan tugas i (i=1,2,3,4,5,6)
A11 = Asisten 1 mengerjakan tugas i (i=1,2,3,4,5,6)
MAX =
100*A01+80*A11+85*A02+70*A12+40*A03+90*A13+45*A04+85*A14+70*A05+80*A15+82*A
06+65*A16;
s.t
A05-A06 = 0;
A15-A16 = 0;
A01+A02+A03+A04+A05+A06 = 3;
A11+A12+A13+A14+A15+A16 = 3;
A01+A11 = 1;
A02+A12 = 1;
A03+A13 = 1;
A04+A14 = 1;
A05+A15 = 1;
A06+A16 = 1;
@BIN(A01);
@BIN(A02);
@BIN(A03);
@BIN(A04);
@BIN(A05);
@BIN(A06);
@BIN(A11);
@BIN(A12);
@BIN(A13);
@BIN(A14);
@BIN(A15);

@BIN(A16);
Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

497.0000
497.0000
0.000000
0
0

Model Class:

PILP

Total variables:
Nonlinear variables:
Integer variables:

12
0
12

Total constraints:
Nonlinear constraints:

11
0

Total nonzeros:
Nonlinear nonzeros:

40
0

Cost
-100.0000
-80.00000
-85.00000
-70.00000
-40.00000
-90.00000
-45.00000
-85.00000
-70.00000
-80.00000
-82.00000
-65.00000
Price
1.000000
0.000000
0.000000
0.000000
0.000000

Variable

Value

A01

1.000000

A11

0.000000

A02

0.000000

A12

1.000000

A03

0.000000

A13

1.000000

A04

0.000000

A14

1.000000

A05

1.000000

A15

0.000000

A06

1.000000

A16

0.000000

Row

Slack or Surplus

497.0000

0.000000

0.000000

0.000000

0.000000

Reduced

Dual

0.000000
0.000000
0.000000
0.000000
0.000000
0.000000

0.000000

0.000000

0.000000

0.000000

10

0.000000

11

0.000000

4.
Keterangan :
Si = tax site untuk corporate location i (i=1,2,3,4)
Ci = audit cost untuk corporate location i (i=1,2,3,4,5)
Min = 160*S1+49*S2+246*S3+86*S4+100*S5 + C1+C2+C3+C4+C5;
s.t
C1 = 0*S11+40*S12+240*S13+40*S14+160*S15;
C2 = 140*S21+0*S22+240*S23+40*S24+80*S25;
C3 = 120*S31+40*S32+0*S33+50*S34+80*S35;
C4 = 120*S41+40*S42+270*S43+0*S44+80*S45;
C5 = 180*S51+40*S52+210*S53+40*S54+0*S55;
S1+S2+S3+S4+S5 >= 1;
S11+S12+S13+S14+S15-5*S1
S21+S22+S23+S24+S25-5*S2
S31+S32+S33+S34+S35-5*S3
S41+S42+S43+S44+S45-5*S4
S51+S52+S53+S54+S55-5*S5
S11+S21+S31+S41+S51
S12+S22+S32+S42+S52
S13+S23+S33+S43+S53
S14+S24+S34+S44+S54
S15+S25+S35+S45+S55

=
=
=
=
=

<=
<=
<=
<=
<=

0;
0;
0;
0;
0;

1;
1;
1;
1;
1;

@Bin(S1);
@Bin(S2);
@Bin(S3);
@Bin(S4);
@Bin(S5);
Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

535.0000
535.0000
0.000000
24
265

Model Class:
Total variables:
Nonlinear variables:
Integer variables:

MILP
35
0
5

Total constraints:
Nonlinear constraints:

17
0

Total nonzeros:
Nonlinear nonzeros:

95
0

Cost
-440.0000
49.00000
246.0000
-114.0000
-300.0000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
160.0000
360.0000
120.0000
200.0000
20.00000
0.000000
240.0000
0.000000
0.000000
0.000000
40.00000
0.000000
10.00000
0.000000
40.00000

Variable

Value

S1

0.000000

S2

1.000000

S3

1.000000

S4

0.000000

S5

0.000000

C1

0.000000

C2

40.00000

C3

200.0000

C4

0.000000

C5

0.000000

S11

0.000000

S12

0.000000

S13

0.000000

S14

0.000000

S15

0.000000

S21

0.000000

S22

1.000000

S23

0.000000

S24

1.000000

S25

0.000000

S31

1.000000

S32

0.000000

S33

1.000000

S34

0.000000

S35

1.000000

S41

0.000000

Reduced

80.00000
310.0000
0.000000
40.00000
140.0000
120.0000
290.0000
80.00000
0.000000
Price
-1.000000
-1.000000
-1.000000
-1.000000
-1.000000
-1.000000
0.000000
120.0000
0.000000
0.000000
40.00000
80.00000
-120.0000
0.000000
0.000000
-40.00000
-80.00000

S42

0.000000

S43

0.000000

S44

0.000000

S45

0.000000

S51

0.000000

S52

0.000000

S53

0.000000

S54

0.000000

S55

0.000000

Row

Slack or Surplus

535.0000

0.000000

0.000000

0.000000

0.000000

0.000000

1.000000

0.000000

3.000000

10

2.000000

11

0.000000

12

0.000000

13

0.000000

14

0.000000

15

0.000000

16

0.000000

17

0.000000

Dual

5.

Keterangan:
Si = site i (i=1,2,3,4)
Rij = site i untuk region j
Min = 200*S1+40*S2+55*S3+75*S4;
s.t
R11+R21 = 1;
R12+R22+R32 = 1;
R13+R33+R43 = 1;
R14+R24 = 1;
R15+R45 = 1;
R11+R12+R13+R14+R15-5*S1 = 0;
R21+R22+R24-3*S2 = 0;
R32+R33-2*S3 = 0;
R43+R45-2*S4 = 0;
@BIN(S1);
@BIN(S2);
@BIN(S3);
@BIN(S4);
Global optimal solution found.
Objective value:
Objective bound:
Infeasibilities:
Extended solver steps:
Total solver iterations:

115.0000
115.0000
0.000000
0
0

Model Class:

MILP

Total variables:
Nonlinear variables:
Integer variables:

16
0
4

Total constraints:
Nonlinear constraints:

10
0

Total nonzeros:
Nonlinear nonzeros:

32
0

Cost
200.0000
40.00000
55.00000
75.00000
0.000000
0.000000
0.000000
0.000000

Variable

Value

S1

0.000000

S2

1.000000

S3

0.000000

S4

1.000000

R11

0.000000

R21

1.000000

R12

0.000000

R22

1.000000

Reduced

R32

0.000000

R13

0.000000

R33

0.000000

R43

1.000000

R14

0.000000

R24

1.000000

R15

0.000000

R45

1.000000

Row

Slack or Surplus

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

115.0000

0.000000

0.000000

0.000000

0.000000

0.000000

0.000000

0.000000

0.000000

10

0.000000

0.000000

6.

Keterangan:
pi = pulp untuk proses i
oi = recycled office paper untuk proses i
w = recycled newsprint
Xi = new paper untuk proses i
Min = 100*(p1+p2+p3)+50*(o1+o2)+20*w;
s.t
p1+p2+p3 <= 80;
((1/3)*p1) = X1;
(1*p2+0.25*o1)/2 = X2;
1*p2-0.25*o1 = 0;
(1*p3+((1/12)*w))/2 = X3;
1*p3-((1/12)*w) = 0;
((1/8)*o2) = X4;

Dual

X1+X2+X3+X4 = 100;
Global optimal solution found.
Objective value:
Infeasibilities:
Total solver iterations:

32000.00
0.000000
3

Model Class:
Total variables:
Nonlinear variables:
Integer variables:

LP
10
0
0

Total constraints:
Nonlinear constraints:
Total nonzeros:
Nonlinear nonzeros:
Cost
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
200.0000
0.000000
40.00000
0.000000
Price
-1.000000
100.0000
-600.0000
-400.0000
0.000000
-440.0000
20.00000
-400.0000
-400.0000

9
0
27
0
Variable

Value

P1

0.000000

P2

80.00000

P3

0.000000

O1

320.0000

O2

160.0000

0.000000

X1

0.000000

X2

80.00000

X3

0.000000

X4

20.00000

Row

Slack or Surplus

32000.00

0.000000

0.000000

0.000000

0.000000

0.000000

0.000000

0.000000

0.000000

Reduced

Dual