EXERCISE 6 : another set covering problem

indices : j= 1, 2 , 3, 4 , 5 routes

is coss
decision variables:;
=[froutes

obj .
F(X) : Min total costs of implementing the routes

obj.
F(x) : Min Z=215k
, +180k+ lok +165ky+ 1302,

constraints:

each customer must be visited least one route

·

by at
-
customer A+ X = I
, +z+g
customer B+X
+X+ X 21
-

,
-
customer C+X , +x 1
-customer D+X
,
+X
,
+
Xg 21
·
route 1 and 5 are
mutually exclusive + y +Yz=1 ,

4y = 1y5 /
0 =

~
y= 0 Yz = 1
i Y= 0
y=
Yz 0
33
=1
=

route 2 and 4 are mutually exclusive + y, +Ya = 1

+ X
; +30, 13 (jz1 ,
2 , 3 , 4 , 5)
 constraints:
·

budget ~
+332+39x3 +45x4 +23x5+27161100
-
(y)
,

capital investment in year #1

-> 25i+ Lozt15t234t3i+2661100 (yz)
-> 30x1 +4822 + 1523 + 4024 + 2525+19461100 (yz)
·
1 and z are mutually exclusive - F + xz =

·
3 and 4 are mutually exclusive -> As +X=

option 3 is not choosen without selecting at least option 1 or option 2 + X3X1+Xz

X3 = 0 + x1 and 2 can take any value

ka1+ =i z2=0 d

- XI0 Xzil y

+ X, =1X2 = 1 v

+ X10 Xzo X

option 4 is not choosen without selecting at least option 1 or option 2 +

XX1+Xz
- Xi -40 13 ,
Jil ,
2 , 3 , 4 , 5, 6)
EXERCISE S :
managing cargo airlines instanbue

-10 + ↑15
-
n *
Istanbul 20 -.
milan

-
# T Istanbul
HUB
consolidation-
-
soarted Sidney
- unloaded
- consolidated
Vic

S
I
# D1 (D1)

↓berein
prague #
20 D2
# D1
(02)
⑤ Da

- London
heathrow
D2
- Home 7 .

HUB
-
⑤ D3 5 n-scow
- 1
7
.

(D3)
milan
(03)
poris
~
, · 4 . budapest
(DG)
s Vienna
madrida (DS)

indices: i=1 , 2 , 3, 4, 3 incoming (or inbound) flights

j = D1, D2 ,
D3, D4, Ds outgoing (or outbound) flights
1 if incoming flight i is assigned to outgoing flight ;
decision variables: =
S 0 otherwise
Exercise 1:
Premium Computer S.p.A. produces two PCs: the Base model,
providing a unit revenue equal to 300€, and the Smart model, which
provides a unit revenue equal to 500€. The production of each model
requires the components shown in the following table. The last
column reports the number of each component currently available in
the company’s warehouse.
Component Base Model Smart Model Qty. Available

Case Base 1 0 60

Case Smart 0 1 50

Hard Disk 1 2 120

Determine the number of PCs of each model to produce in order to

maximize the total revenue.
The optimization model in extended form:

max z= 300x1 + 500x2

 x1  60
 x  50
 2
constraints: 
 x1 + 2 x2  120
 x1 , x2  0 and integer

…or, in compact form…

 2
Max z = c x
j =1
j j where:
c'= 300,500
 2

 a1 j x j  b1 a1' = 1,0
 j =1
2 a2' = 0,1
 a 2 j x j  b2 a3' = 1,2
cons.:  j =1
2 b1 = 60
 a3 j x j  b3 b2 = 50
 j =1
 x  0 and integer j = 1,2. b3 = 120
 j
Model implemented in compact form in AMPL: File
.mod
Model implemented in compact form in AMPL: File
.dat
Obtain the optimal solution
 Obtain the optimal solution

You can get additional information regarding the optimal solution

using the same commands shown for the extended form.
For the decision variables:

For the constraints:

 Vectors of constraints
where:

c'= 300,500
2

max  c j x j
j=1
1 0 
2  

cons.:  j=1
a ij x j  bi (i = 1,...,3) A = 0 1 
1 2
x  0 and integer j = 1,2
 j
b'= [60, 50,120]
Model implemented in compact form in AMPL: File
.mod
Model implemented in compact form in AMPL: File
.dat
Obtain the optimal solution