Definitions and Step Descriptions

The variables LPn,LPb,LPl,Lpe represent the quantity of goods transferred from

Liverpool factory to Newcastle, Brimingham, London and exeter depots respectively.The
corresponding costs for transfer are denoted by variables c(LP,n),c(LP,b),c(LP,l),c(LP,e). In
case such transfer is not possible, the cost is assumed to be infinitely high which in the
context of the problem is set to be 9999
The variables BRn,BRb,BRl,BRe represent the quantity of goods transferred from
Brighton factory to Newcastle, Brimingham, London and exeter depots respectively. The
corresponding costs for transfer are denoted by variables c(BR,n),c(BR,b),c(BR,l),c(BR,e). In
case such transfer is not possible, the cost is assumed to be infinitely high which in the
context of the problem is set to be 9999.
The variables BRi , i ranging from 1 to 6 represent the quantity of goods transferred from
Brighton factory directly to customer i.The corresponding costs for transfer are denoted by
variables c(BR,i). In case such transfer is not possible, the cost is assumed to be infinitely
high which in the context of the problem is set to be 9999. Similarly LPi and c(LP,i) denote
the quantity transferred from Liverpool factory to customer i
The variables ni, bi, li,ei with 'I' ranging from 1 to 6 represent the quantity
transferred from Newcastle, Birmingham, London and Exeter depots to customer i.Their
corresponding costs are denoted by c(n,i),c(b,i),c(l,i),c(e,i). Its set as 9999 if
transfer to that customer is not possible.
Constraint Description
The sum of transferred quantity from Liverpool should be less than its capacity
The sum of transferred quantity from Brighton should be less than its capacity
The quantity that each customer demands should be met.
The product inflow of each depot should be greater than or equal to the outflow.
The product outflow from each depot should not exceed its throughput.
The following constraints are introduced to make sure the impossible transfers are
restricted. This constraint is also enforced by setting the cost of impossible transfers as
9999
Cost of transfer from the two factories to all the depots.
Cost of customer specific transfer directly from factories and from depots. The sum
of costs incurred for the step where the destination is customer is added for each
customer
The objective is to minimize the sum of the above mentioned two costs
To depot from factory
Quantity Cost
LPn 0 c(LP,n) 0.5
LPb 0 c(LP,b) 0.5
LPl 0 c(LP,l) 1
Lpe 40000 c(LP,e) 0.2
BRn 0 c(BR,n) 9999
BRb 50000 c(BR,b) 0.3
BRl 55000 c(BR,l) 0.5
Bre 0 c(BR,e) 0.2
To customer from factory
LP1 50000 c(LP,1) 1 BR1
LP2 0 c(LP,2) 9999 BR2
LP3 0 c(LP,3) 1.5 BR3
LP4 0 c(LP,4) 2 BR4
LP5 0 c(LP,5) 9999 BR5
LP6 20000 c(LP,6) 1 BR6
To customer from Depot
n1 0 c(n,1) 9999 b1
n2 0 c(n,2) 1.5 b2
n3 0 c(n,3) 0.5 b3
n4 0 c(n,4) 1.5 b4
n5 0 c(n,5) 9999 b5
n6 0 c(n,6) 1 b6
l1 0 c(l,1) 9999 e1
l2 0 c(l,2) 1.5 e2
l3 0 c(l,3) 2 e3
l4 0 c(l,4) 9999 e4
l5 55000 c(l,5) 0.5 e5
l6 0 c(l,6) 1.5 e6
Constraints Value Condition Limit
Liverpool Capacity 110000 <= 150000
Brighton Capacity 105000 <= 200000
Customer 1 Requirement 50000 >= 50000
Customer 2 Requirement 10000 >= 10000
Customer 3 Requirement 40000 >= 40000
Customer 4 Requirement 35000 >= 35000
Customer 5 Requirement 60000 >= 60000
Customer 6 Requirement 20000 >= 20000
Depot 'n' total supply 0 >= 0
Depot 'b' total supply 50000 >= 50000
Depot 'l' total supply 55000 >= 55000
Depot 'e' total supply 40000 >= 40000
Depot 'n' total demand 0 <= 70000
Depot 'b' total demand 50000 <= 50000
Depot 'l' total demand 55000 <= 100000
Depot 'e' total demand 40000 <= 40000
Impossible combinations
Customer 1
BRn 0 Eq 0
n1 0 Eq 0
l1 0 Eq 0
e1 0 Eq 0
Customer 2
LP2 0 Eq 0
BR2 0 Eq 0
e2 0 Eq 0
Customer 3
BR3 0 Eq 0
Customer 4
BR4 0 Eq 0
l4 0 Eq 0
Customer 5
BR5 0 Eq 0
n5 0 Eq 0
Customer 6
BR6 0 Eq 0
b6 0 Eq 0
Cost: Factory to Depot
Sum of the costs 50500
Cost: Customer wise
Sum of costs from depot and
costs from factory 148000
Objective Function
Total costs 198500
Keys
Variables with fixed values
Changing Variables
Constraints
Objective Function
0 c(BR,1) 2
0 c(BR,2) 9999
0 c(BR,3) 9999
0 c(BR,4) 9999
0 c(BR,5) 9999
0 c(BR,6) 9999
0 c(b,1) 1
10000 c(b,2) 0.5
0 c(b,3) 0.5
35000 c(b,4) 1
5000 c(b,5) 0.5
0 c(b,6) 9999
0 c(e,1) 9999
0 c(e,2) 9999
40000 c(e,3) 0.2
0 c(e,4) 1.5
0 c(e,5) 0.5
0 c(e,6) 1.5