LECTURE Assignment Tranship 24may 1jun24
LECTURE Assignment Tranship 24may 1jun24
s.t
j n
X
j1
ij
1(i 1,2,........m)
i m
X
i1
ij
1( j 1,2,.....n)
X ij
0(i 1,2,.....m; j 1,2,....n)
X ij
1(i 1,2,.....m; j 1,2,....n)
ASSIGNMENT PROBLEM—INDUSTRY MACHINE ALLOCATION
Machine1 14 5 8 7
Machine2 2 12 6 5
Machine3 7 8 3 9
Machine4 2 4 6 10
Minimize the total set up time needed to complete the four jobs.
ASSIGNMENT PROBLEM OPTIMAL INDUSTRY MACHINE ALLOCATION
ASSIGNMENT PROBLEM
Person1 50 46 42 40
Person2 51 48 44
Person3 47 45 45
Person 1 can do only one job, but person 2 and person 3 can do
up to two jobs.
Determine the minimum cost assignment of persons to jobs.
ASSIGNMENT PROBLEM—OPTIMAL BID EVALUATION
ASSIGNMENT PROBLEM
LHS 1 1 1 1
DEMAND 1 1 1 1
TRANSSHIPMENT PROBLEM
In Transportation Problem, we considered
shipment go from a supply point to demand
point.
c15 c46
4 c47
c23 c24
c56 7 d2
s2 2
c25
5 c57
Min SScijxij
ij
s.t. Sxij < si for each source (origin) i
j
Sxik - Sxkj = 0 for each intermediate
i j node k (conservation of flow)
Thomas Washburn
Arnold 5 8
Supershelf 7 4
5 1
ARNOLD
-75 Arnold Thomas 5
6
8 8
Hewes
HEWES +60
2 4
3 4
7
-75 Super Wash-
WASH 7
Shelf Burn
BURN
4 4
Rock-
Supply nodes Transshipment Wright +40
nodes
Demand nodes
Example 1: Thomas &
Washburn
Linear Programming Formulation
Decision Variables Defined
xij = amount shipped from manufacturer i to supplier j
xjk = amount shipped from supplier j to customer k
where i = 1 (Arnold), 2 (Supershelf)
j = 3 (Thomas), 4 (Washburn)
k = 5 (Zrox), 6 (Hewes), 7 (Rockwright)
Objective Function Defined
Minimize Overall Shipping Costs:
Min 5x13 + 8x14 + 7x23 + 4x24 + 1x35 + 5x36 + 8x37
+ 3x45 + 4x46 + 4x47
Example 1: Thomas &
Washburn
Constraints Defined
Amount Out of Arnold: x13 + x14 < 75
Amount Out of Supershelf: x23 + x24 < 75
Amount Through Thomas: x13 + x23 - x35 - x36 - x37 = 0
Amount Through Washburn: x14 + x24 - x45 - x46 - x47 = 0
Amount Into Zrox: x35 + x45 > 50
Amount Into Hewes: x36 + x46 > 60
Amount Into Rockwright: x37 + x47 > 40
Supply (-) or
Nodes Net Flow Demand (+)
1 Arnold -75 -75
2 SuperShelf -75 -75
3 Thomas 0 0
4 Washburn 0 0
5 Zrox 50 50
6 Hewes 60 60
7 Rock-Wright 40 40
Columbus: 60
Atlanta: 170
Richmond: 80
Mobile: 70.
The shipping costs per unit for are shown in the next slide. You are
retained (for a large consulting fee) to determine shipping quantities
to minimize the total shipping cost.
Example 2: The Bavarian Motors
From
Company
1 Newark
To
(BMC)
2 Boston
Unit Cost
$30
1 Newark 4 Richmond $40
2 Boston 3 Columbus $50
3 Columbus 5 Atlanta $35
5 Atlanta 3 Columbus $40
5 Atlanta 4 Richmond $30
5 Atlanta 6 Mobile $35
6 Mobile 5 Atlanta $25
7 Jacksonville 4 Richmond $50
7 Jacksonville 5 Atlanta $45
7 Jacksonville 6 Mobile $50
Example 2: The Bavarian Motors
Company$45(BMC)$40 ZROX
Richmond
(4)
80
100
Atlanta
$35 HEWES
(5) 170
$50
$25
Jacksonville Columbus
300 (7)
WASH
(3)
$40 $35
BURN
Mobile
60 $50 70
Supply nodes (6)
Example 2: The Bavarian Motors
Company (BMC)
Linear Programming Formulation:
Table 6–2 Cost of Shipping One Unit from the Farms to Warehouses
Farm Capacity in Mton
100
200
200
Table 6–2 Cost of Shipping One Unit from the Warehouses to Projects
Project Demand in Mton 50 150 300
A Network Diagram of
Sand and Gravel Pit
Transshipment Example
The diagram of the transshipment problem is given.