IEDA HOMEWORK 3

Name: Sreyashi Ganguli

Student ID: 21015852

1)
Factories Location Weight
P1 (5,10) 3
P2 (7,6) 8
P3 (4,2) 2
P4 (16,3) 10

Let’s consider the optimal x value:

On arranging in an increasing order:
Factories Location (x value) Weight Cumulative
(ai) (wi) Weight
P3 4 2 2
P1 5 3 5
P2 7 8 13
P4 16 10 23

Dividing the total cumulative weight = 23/2 = 11.5

The lowest location with a value greater than 11.5 is P2 with x=7.
Let’s consider the optimal y value:
On arranging in an increasing order:
Factories Location (y value) Weight Cumulative
(bi) (wi) Weight
P3 2 2 2
P4 3 10 12
P2 6 8 20
P1 10 3 23

Dividing the total cumulative weight = 23/2 = 11.5

The lowest location with a value greater than 11.5 is P4 with y=3.
Optimal solution = (7,3).
This solution is unique.

2) Constraints:
The transportation time between 2 locations should be within 8 minutes.

Neighbourhood x1 x2 x3 x4 x5 x6 x7
(xi)
Cost (Ci) 100 80 120 110 90 90 110

Min x1 + x2 + x3 + x4 + x5 + x6 + x7
Subject to:
x1 + x3 + x7 >=1
x5 + x6 + x7 >=1
x4 + x5 + x6 >=1
x4>=1
x5>=1
Constraints x1 x2 x3 x4 x5 x6 x7
x1 1 1 0 1 0 0 1
x2 1 1 0 0 1 1 1
x3 0 0 1 1 1 1 0
x4 1 0 1 1 0 0 1
x5 0 1 1 0 1 1 0
x6 0 1 1 0 1 1 0
x7 1 1 0 1 0 0 1
Di 4 5 4 4 4 4 4
Ci/Di 25 16 30 27.5 22.5 22.5 27.5

The lowest value of Ci/Di =16.

So we set value of x2=1.
So we remove every constraint with x2=1.

Constraints x1 x3 x4 x5 x6 x7
x3 0 1 1 1 1 0
x4 1 1 1 0 0 1
Di 1 2 2 1 1 1
Ci/Di 100 60 55 90 90 110

The lowest value of Ci/Di = 55

So we set a value of x4=1.
So, we remove every constraint with x4=1.
There remain no more constraints.

Hence, the optimal locations for units are in zones x2 and x4 = 1 where xij= 1 if a unit in i
covers region j.
x2 covers regions 1,2,5,6,7 and x4 covers regions 1,3,4, and 7.

b) Cost of setting up unit 4 = 110000000$

Cost of setting up unit 2 = 80000000$

The minimum cost of setting up = 110000000$ + 80000000 $= 190000000$