RISET OPERASI

Pertemuan ke-10
Distribution and Network Model

Dika Virginia

DEPARTEMEN TEKNIK TRANSPORTASI

LAUT
FAKULTAS TEKNOLOGI KELAUTAN
INSTITUT TEKNOLOGI SEPULUH
NOPEMBER
1

Semester Genap 2020/2021

 Transportation Problem
 Network Representation
 General LP Formulation

 Assignment Problem
 Network Representation
 General LP Formulation

 Transshipment Problem
 Network Representation
 General LP Formulation
Transportation, Assignment, and Transshipment Problems

A network model is one which can be

represented by a set of nodes, a set of
arcs, and functions (e.g. costs,
supplies, demands, etc.) associated
with the arcs and/or nodes.
 Transportation, assignment,
transshipment, shortest-route, and
maximal flow problems of this chapter
as well as the minimal spanning tree
and PERT/CPM problems (in others
chapter) are all examples of network
problems.
Transportation, Assignment, and Transshipment Problems

 Each of the five problems of this chapter can

be formulated as linear programs and solved
by general purpose linear programming
codes.
 For each of the five problems, if the right-
hand side of the linear programming
formulations are all integers, the optimal
solution will be in terms of integer values for
the decision variables.
 However, there are many computer packages
that contain separate computer codes for
these problems which take advantage of their
network structure.
Transportation Problem

 The transportation problem seeks to minimize the

total shipping costs of transporting goods from m
origins (each with a supply si) to n destinations
(each with a demand dj), when the unit shipping
cost from an origin, i, to a destination, j, is cij.
 The network representation for a transportation
problem with two sources and three destinations
is given on the next slide.
 Transportation Problem
 Network Representation
1 d1
c1
s1 1 1
c12
c13
2 d2
c21

s2 2 c22
c23
3 d3

Sources Destinations
 Transportation Problem: Example #1

Acme Block Company has orders for 80 tons of concrete

blocks at three suburban locations as follows:

Northwood -- 25 tons, Westwood -- 45 tons, and

Eastwood -- 10 tons. Acme has two plants, each of
which can produce 50 tons per week.

Delivery cost per ton from each plant to each suburban

location is shown on the next slide. How should end of
week shipments be made to fill the above orders?
Transportation Problem: Example #1

 Delivery Cost $ Per Ton

Northwood Westwood
Eastwood
Plant 1 24 30
40
Plant 2 30 40
Decision
42 Variables. the tons of concrete blocks,
xij , to be shipped from source i to destination j.

Northwood Westwood
Eastwood
Plant 1 x11 x12 x13
Plant 1 x21 x22 x23
 Transportation Problem: Example
#1
Objective Function

 Define the Objective Function

 Minimize the total shipping cost.
 Min: (shipping cost per ton for each origin to
destination) × (number of pounds shipped
from each origin to each destination).
Min: 24x11 + 30x12 + 40x13 + 30x21 + 40x22
+ 42x23
Transportation Problem: Example #1
Constraints
 Define the Constraints
Supply constraints:
(1) x11 + x12 + x13 = 50
(2) x21 + x22 + x23 = 50

Demand constraints:
(4) x11 + x21 = 25
(5) x12 + x22 = 45
(6) x13 + x23 = 10
Non-negativity of variables:
xij > 0, i = 1, 2 and j = 1, 2, 3
Transportation Problem: Example #1
≤ and ≥ Constraints
 Define the Constraints
Supply constraints:
(1) x11 + x12 + x13 ≤ 50
(2) x21 + x22 + x23 ≤ 50

Demand constraints:
(4) x11 + x21 ≥ 25
(5) x12 + x22 ≥ 45
(6) x13 + x23 ≥ 10
Non-negativity of variables:
xij > 0, i = 1, 2 and j = 1, 2, 3
Transportation Problem: Example #1
 Partial Spreadsheet Showing Problem
Data
A B C D E F G H
1 LHSCoefficients
2 Constraint X11 X12 X13 X21 X22 X23 RHS
3 #1 1 1 1 50
4 #2 1 1 1 50
5 #3 1 1 25
6 #4 1 1 45
7 #5 1 1 10
8 Obj.Coefficients 24 30 40 30 40 42 30
Transportation Problem: Example #1
Decision Variable Table
Northwood Westwood Eastwood LHS
Plant 1 5 45 0 50 ≤
Plant 2 20 0 10 30 ≤
LHS 25 45 10 2490
≥ ≥ ≥
RHS 25 45 10
Transportation Problem: Example #1

 Optimal Solution

From To Amount
Cost
Plant 1 Northwood 5
120
Plant 1 Westwood 45
1,350
Plant 2 Northwood 20
600
Plant 2 Eastwood 10
420
Total
Cost = $2,490
Transportation Problem: Example #1
Sensitivity Report
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$9 Plant 1 Northwood 5 0 24 4 4
$C$9 Plant 1 Westwood 45 0 30 4 36
$D$9 Plant 1 Eastwood 0 4 40 1E+30 4
$B$10 Plant 2 Northwood 20 0 30 4 4
$C$10 Plant 2 Westwood 0 4 40 1E+30 4
$D$10 Plant 2 Eastwood 10 0 42 4 42

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$B$11 LHS Northwood 25 30 25 20 20
$C$11 LHS Westwood 45 36 45 5 20
$D$11 LHS Eastwood 10 42 10 20 10
$E$9 Plant 1 LHS 50 -6 50 20 5
$E$10 Plant 2 LHS 30 0 50 1E+30 20
Transportation Problem: Example
#2
The Navy has 9,000 pounds of material in
Albany, Georgia that it wishes to ship to three
installations:
San Diego, Norfolk, and Pensacola. They require
4,000, 2,500, and 2,500 pounds, respectively.
Government regulations require equal
distribution of shipping among the three carriers.

The shipping costs per pound for truck,

railroad, and airplane transit are shown on the
next slide. Formulate and solve a linear program
to determine the
shipping arrangements (mode, destination, and
quantity) that will minimize the total shipping
cost.
Transportation Problem: Example
#2

Destination
Mode San Diego Norfolk
Pensacola
Truck $12 $6
$5
Railroad 20 11
9
Airplane 30 26
28
Transportation Problem: Example
#2
 Define the Decision Variables
We want to determine the pounds of
material, xij , to be shipped by mode i to
destination j. The following table
summarizes the decision variables:
San Diego Norfolk
Pensacola
Truck x11 x12
x13
Railroad x21 x22
x23
Airplane x31 x32
x33
 Transportation Problem: Example
#2

 Define the Objective Function

 Minimize the total shipping cost.
 Min: (shipping cost per pound for each mode per
destination pairing) x (number of pounds shipped by
mode per destination pairing).
Min: 12x11 + 6x12 + 5x13 + 20x21 + 11x22 + 9x23
+ 30x31 + 26x32 + 28x33
Transportation Problem: Example
#2
 Define the Constraints
Equal use of transportation modes:
(1) x11 + x12 + x13 = 3000
(2) x21 + x22 + x23 = 3000
(3) x31 + x32 + x33 = 3000
Destination material requirements:
(4) x11 + x21 + x31 = 4000
(5) x12 + x22 + x32 = 2500
(6) x13 + x23 + x33 = 2500
Non-negativity of variables:
xij > 0, i = 1, 2, 3 and j = 1, 2,
3
Transportation Problem: Example
#2
Cost Table
San Siego Norfolk Pensacola
Truck 12 6 5
Railroad 20 11 9
Airplane 30 26 28
`

Decision Variable Table

San Siego Norfolk Pensacola LHS RHS
Truck 1000 2000 0 3000 ≤ 3000
Railroad 0 500 2500 3000 ≤ 3000
Airplane 3000 0 0 3000 ≤ 3000
LHS 4000 2500 2500 142000
<= <= <=
RHS 4000 2500 2500
Transportation Problem

 Linear Programming Formulation

Using the notation:
xij = number of units shipped from
origin i to destination j
cij = cost per unit of shipping from
origin i to destination j
si = supply or capacity in units at origin i
dj = demand in units at destination j
continued
 Transportation Problem

 Linear Programming Formulation (continued)

m n
Min  c x
i 1 j 1
ij ij

x
j 1
ij si i 1,2, ,m Supply
m

 x >d
i 1
ij j j 1,2, ,n Demand

xij > 0 for all i and j

Min: ( 12x11 + 6x12 + 5x13 )+( 20x21 + 11x22 + 9x23) + (30x31 + 26x32 + 28x33
Then?

The Network Representation

of the Grand Prix Problem
• Model Matematika pada Transportation problem (lanjutan)
– Misalkan xij adalah jumlah yang diangkut dari titik i ketitik j, maka
persoalan transportasi
m n
dapat dituliskan sebagai berikut:
minimize z    c x Deskripsi notasi:
ij ij
i1 j 1 banyaknya unit yang didistribusikan dari titik
subject to: sumber i ke titik tujuan j
n
 xij  ai i  1,2,m
j 1
jumlah supplay dari sumber i
m
j  1,2,n jumlah demand pada titik tujuan j

i xij  b j biaya per unit yang didistribusikan dari titik sumber i
1
xij  0 for all i and j ke titik tujuan j

– Jika kondisi terpenuhi, maka kondisi ini disebut dengan

m n

 a1   bj
i1 j
1

balanced transportation model  semua constraint berbentuk sama

dengan. Dan kondisi tersebut akan memberikan feasible solution pada
Trans. Prob.
– Pada kondisi unbalanced  perlu dummy variables
Algoritma penyelesaian masalah transportasi adalah sebagai berikut :
A. Tentukan penyelesaian fisibel awal.
B. Uji, apakah penyelesaian yang didapatkan pada langkah (1) sudah optimal.
C. Jika belum optimal, tingkatkan keoptimalan penyelesaian
D. Ulangi langkah (1) – (3) hingga didapatkan penyelesaian optimal.

E. Penyelesaian Fisibel Awal

Penyelesaian fisibel awal digunakan untuk menentukan penyelesaian awal dalam masalah
transportasi.
Northwest Corner Rule (Metode Barat Laut)
Metode Penyelesaian Fisible
Awal (mencari basis dan non the Stepping Stone method (Metode Biaya Terendah)
basis variable)
Vogel method
the Stepping Stone method

p.s. Jika tabel transportasi terdiri dari m baris dan n kolom, maka penyelesaian awal harus
menghasilkan m+n-1 buah variabel basis (sel yang terisi). Jika penyelesaian awalnya berisi kurang dari
m+n-1 buah variabel basis, maka harus ditambahkan variabel dummy agar proses pengecekan
keoptimalan dan iterasi dapat dilakukan.
B. Finding the Optimal Solution
 Once an initial solution has been found, the next step is to test that solution for
optimality. The following two methods are widely used for testing the solutions:
 Stepping Stone Method
 Modified Distribution Method (MODI)

 The two methods differ in their computational approach but give exactly the same
results and use the same testing procedure.

Optimality test: A BF solution is optimal if and only if for every such that is non-
basic

Algoritma untuk merevisi tabel adalah sebagai berikut :

1. Pilih variabel bukan basis (sel kosong) dengan nilai cij – ui – vj < 0 yang paling minimum.
2. Isi sel tersebut dengan kuantitas sebanyak mungkin
3. Sesuaikan kuantitas xij pada sel-sel lain dalam loop
4. Cek apakah penyelesaian baru sudah optimal. Jika belum lakukan kembali langkah 1-4.
C. Merevisi Table

Tabel optimal jika untuk setiap sel bukan basis (non basis variable), nilai . Jika ada salah satu sel
saja yang nilai negatif, maka tabel tidak optimal dan perlu ditingkatkan optimalitasnya.

Untuk merevisi tabel, digunakan loop, yaitu barisan sel basis (sel tidak kosong) dengan sifat :
1. (Any two consecutive cells lie either in the same row/column) Terdapat 2 sell berurutan
yang teretak pada baris/kolom yang sama.
2. (No three or more cells lie either in the same row/column) Tidak ada 3 (atau lebih) sel
berurutan yang terletak pada baris/kolom yang sama.
3. (The last cell is in the same row/column as in the first cell) Sel pertama dan terakhir
barisan terletak pada baris/kolom yang sama.
4. (the is no cell appears more than once in the same row/column) Tidak ada sel yang
muncul lebih dari satu kali dalam barisan
Exercise!
 Solve it by hand!
Alat-alat rumah tangga akan dikirim dari 4 buah distributor (A, B, C, D) ke 3 toko (1, 2, dan 3). Jumlah
barang yang siap dikirim dari distributor A, B, C dan D masing-masing adalah 300, 200, 600, dan 500
unit. Kebutuhan toko 1, 2, dan 3 masing-masing adalah 200, 1000 dan 400 unit. Biaya pengiriman
(ribuan) dari distributor ke toko tampak dalam tabel 5.4. Tentukan penyelesaian fisibel awal dengan
metode barat laut, lalu cek nilai optimalnya.
 Special Case on Transportation
Problem

Unbalanced
Restricted Unfulfilled Maximization
Transportation Degeneracy
Area Demand Problem
Problem
Transportation Problem
LP Formulation Special Cases
• Total supply exceeds total demand:
No modification of LP formulation is necessary.
• Total demand exceeds total supply:
Add a dummy origin with supply equal
to the shortage amount. Assign a zero
shipping cost per unit. The amount
“shipped” from the dummy origin (in
the solution) will not actually be
shipped.
Transportation Problem
 LP Formulation Special Cases (continued)
 The objective is maximizing profit or revenue:

Solve as a maximization problem.

 Minimum shipping guarantee from i to j:

xij > Lij

 Maximum route capacity from i to j:

xij < Lij

 Unacceptable route:

Remove the corresponding decision variable.

A. Unbalanced Transportation
Problem
 In real-life problems, total demand is not equal to total supply. These
unbalanced problems can be handled easily by using dummy sources or dummy
destinations.
DUMMY
DESTINATIONS

 If total supply is greater than total demand, a dummy destination (warehouse),

with demand exactly equal to the surplus, is created.
DUMMY
SOURCES

 If total demand is greater than total supply, introduce a dummy source (factory)
with a supply equal to the excess of demand over supply.
Attention!!
 Regardless of whether demand or supply exceeds the other, shipping cost
coefficients of zero are assigned to each dummy location or route because no
shipments will actually be made from a dummy factory or to a dummy
warehouse.
 Any units assigned to a dummy destination represent excess capacity, and units
assigned to a dummy source represent unmet demand.
Unbalanced Problem
Demand Less than Supply
Customer Customer Dummy
1 2 Factory
Capacity
8 5 0
Factory 1
170

15 10 0
Factory 2
130

3 9 0
Factory 3
80

Customer
Requirements 150 80 150 380
Unbalanced Problem
Supply Less than Demand
Customer Customer Customer Factory
1 2 3 Capacity

Factory 1 8 5 16
170

Factory 2 15 10 7
130

Dummy 0 0 0
80

Customer
Requirements 150 80 150 380
B. Degeneracy
 In a transportation tableau with m rows and n columns, there must be
m + n - 1 cells with allocations; if not, it is degenerate.
 The tableau in the figure does not meet the condition since 3 + 3
-1 = 5 cells and there are only 4 cells with allocations.
 In a degenerate tableau, all the stepping-stone paths or MODI equations cannot be
developed.
 To rectify a degenerate tableau, an empty cell must artificially be treated as an occupied cell.

The stepping-stone path

and cost changes for this
tableau.
C. Unacceptable or Restricted Route
 At times there are transportation problems in which one of the sources is
unable to ship to one or more of the destinations.
 When this occurs, the problem is said to have an unacceptable or
prohibited route.
 In a minimization problem, such a prohibited route is assigned a very high
cost to prevent this route from ever being used in the optimal solution.
 After this high cost is placed in the transportation table, the problem is solved
using the techniques previously discussed.
 In a maximization problem, the very high cost used in minimization problems
is given a negative sign, turning it into a very bad profit.
 Contoh:

Alat-alat rumah tangga akan dikirim dari 4 buah distributor (A, B, C, D) ke 3 toko (1, 2, dan 3). Jumlah
barang yang siap dikirim dari distributor A, B, C dan D masing-masing adalah 360, 120, 125, dan 200
unit. Kebutuhan toko 1, 2, dan 3 masing-masing adalah 220, 240, 125 dan 200 unit. Toko-2 tidak mau
menerima barang dari cabang A dan toko-3 tidak mau menetima barang dari cabang C. Biaya
pengiriman (ribuan) dari distributor ke toko tampak dalam tabel 5.4. Tentukan penyelesaian fisibel
awal dengan metode Vogel.
D. Penalty Given on Unfulfilled
Demand
Example:
Two reservoirs are available to supply the water needs of three cities. Each reservoir can
supply up to 50 million gallons of water per day. Each city would like to receive 40 million
gallons per day. For each million gallons per day of unmet demand, there is a penalty. At
city 1, the penalty is $20; at city 2, the penalty is $22; and at city 3, the penalty is $23. The
cost of transporting 1 million gallons of water from each reservoir to each city is shown in
Table 4. Formulate a balanced transportation problem that can be used to minimize the
sum of shortage and transport costs. The shipping cost for reservoir:
Assignment
Problem
Assignment Problem

 An assignment problem seeks to minimize the total cost

assignment of m workers to n jobs, given that the cost of
worker i performing job j is cij.
 It assumes all workers are assigned and each job is performed.
 An assignment problem is a special case of a transportation
problem in which all supplies and all demands are equal to 1;
hence assignment problems may be solved as linear
programs.
 The network representation of an assignment problem with
three workers and three jobs is shown on the next slide.
Assignment Problem
 Network Representation

c11
1 1
c12
c13
Agents Tasks
c21
c22
2 2
c23
c31
c32
3 3
c33
Assignment Problem: Example
An electrical contractor pays his subcontractors a fixed
fee plus mileage for work performed. On a given day
the contractor is faced with three electrical jobs
associated with various projects. Given below are the
distances between the subcontractors and the projects.
Projects
Subcontractor A B C
Westside 50 36 16
Federated 28 30 18
Goliath 35 32 20
Universal 25 25 14

How should the contractors be assigned so that total

mileage is minimized?
Assignment Problem: Example
 Network Representation
50
West. A
36
16
Subcontractors Projects
28
30
Fed. B
18
35 32

Gol.
20
C
25
25

Univ. 14
Assignment Problem: Example
 Linear Programming Formulation

Min 50x11+36x12+16x13+28x21+30x22+18x23

+35x31+32x32+20x33+25x41+25x42+14x43
s.t. x11+x12+x13 < 1
Agents
x21+x22+x23 < 1
x31+x32+x33 < 1
x41+x42+x43 < 1
x11+x21+x31+x41 = Tasks
1
x12+x22+x32+x42 = 1
x13+x23+x33+x43 = 1
xij = 0 or 1 for all i and j
Assignment Problem: Example
 Linear Programming Formulation

Min 50x11+36x12+16x13+28x21+30x22+18x23

+35x31+32x32+20x33+25x41+25x42+14x43
s.t. x11+x12+x13 < 1
Agents
x21+x22+x23 < 1
x31+x32+x33 < 1
x41+x42+x43 < 1
x11+x21+x31+x41 ≥ Tasks
1
x12+x22+x32+x42 ≥ 1
x13+x23+x33+x43 ≥ 1
xij = 0 or 1 for all i and j
Transportation Problem: Example
#2
Cost Table
Project A Project B Project C
Westside 50 36 16
Federated 28 30 18
Goliath 35 32 20
Universal 25 25 14
`

Decision Variable Table

San Siego Norfolk Pensacola LHS RHS
Westside 0 0 1 1 ≤ 1
Federated 1 0 0 1 ≤ 1
Goliath 0 0 0 0 ≤ 1
Universal 0 1 0 1 ≤ 1
LHS 1 1 1 69
≥ ≥ ≥
RHS 1 1 1
Assignment Problem: Example
 The optimal assignment is:

Subcontractor Project Distance

Westside C 16
Federated A 28
Goliath (unassigned)
Universal B 25
Total Distance = 69
miles
Assignment Problem

 Linear Programming Formulation

Using the notation:

xij = 1 if agent i is assigned to

task j

0 otherwise

cij = cost of assigning agent i to

task j continued
Assignment Problem
 Linear Programming Formulation (continued)
m n
Min  c x
i 1 j 1
ij ij

x
j 1
ij 1 i 1,2, ,m Agents
m

x
i 1
ij 1 j 1,2, ,n Tasks

xij > 0 for all i and j

Assignment Problem

 LP Formulation Special Cases

• Number of agents exceeds the number of
tasks:
Extra agents simply remain unassigned.

• Number of tasks exceeds the number of

agents:
Add enough dummy agents to
equalize the
number of agents and the number of
tasks.
The objective function coefficients for
these
new variable would be zero.
Assignment Problem
 LP Formulation Special Cases (continued)
• The assignment alternatives are evaluated
in terms of revenue or profit:

Solve as a maximization
problem.
• An assignment is unacceptable:
Remove the corresponding decision
variable.
• An agent
n

 xis permitted
j 1
to,m
t i 1,2,
ij
work t tasks:
A gents
Transshipment Problem
 Transshipment problems are transportation
problems in which a shipment may move through
intermediate nodes (transshipment nodes)before
reaching a particular destination node.
 Transshipment problems can be converted to
larger transportation problems and solved by a
special transportation program.
 Transshipment problems can also be solved by
general purpose linear programming codes.
 The network representation for a transshipment
problem with two sources, three intermediate
nodes, and two destinations is shown on the next
slide.
Transshipment Problem
 Network Representation

Transit
c36
Nodes 3
c13
s1 1 c37 6 d1
c14
c15 c46
Supply 4 c47 Deman
c23 d
c24 c56
s2 2 7 d2
c25
5 c57
Sources Destinations
Intermediate Nodes
Transshipment Problem

 Linear Programming Formulation

Using the notation:

xij = number of units shipped from node i to
node j
cij = cost per unit of shipping from node i to
node j
si = supply at origin node i continued
dj = demand at destination node j
Transshipment Problem
 Linear Programming Formulation
(continued)
Min  cij xij
all arcs

s.t. 
arcs out
xij  x
arcs in
ij si Origin nodes i
Supply Transit


arcs out
xij  x
arcs in
ij 0 Transhipment nodes

x
arcs in
ij  
arcs out
xij dj Destination nodes j

xij > 0 for all i and j

continued
Transshipment Problem

 LP Formulation Special Cases

• Total supply not equal to total demand
• Maximization objective function
• Route capacities or route minimums
• Unacceptable routes
The LP model modifications required here are
identical to those required for the special
cases in
the transportation problem.
Transshipment Problem: Example
The Northside and Southside facilities of Zeron Industries
supply three firms (Zrox, Hewes, Rockrite) with customized
shelving for its offices. They both order shelving from the
same two manufacturers, Arnold Manufacturers and
Supershelf, Inc.

Currently weekly demands by the users are 50 for Zrox, 60

for Hewes, and 40 for Rockrite. Both Arnold and
Supershelf can supply at most 75 units to its customers.
Additional data is shown on the next slide.
Transshipment Problem: Example

Because of long standing contracts based on

past orders, unit costs from the
manufacturers to the suppliers are:
Zeron N Zeron S
Arnold 5 8
Supershelf 7 4
The costs to install the shelving at the various
locations are:
Zrox Hewes Rockrite
Zeron N 1 5 8
Zeron S 3 4 4
Transshipment Problem: Example
 Network Representation
ZROX

50
Zrox
5 1
Zeron
75 ARNOLD
Arnold
N 5
8 8
Hewes
HEWES 60

7 3
Super Zeron
WASH 4
75 Shelf S
BURN
4 4 Rock-
Rite 40
Transshipment Problem: Example
 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 (Zeron N), 4 (Zeron S)
k = 5 (Zrox), 6 (Hewes), 7 (Rockrite)
 Objective Function Defined
Minimize Overall Shipping Costs:
Min 5x13 + 8x14 + 7x23 + 4x24 + 1x35 + 5x36 + 8x37
+ 3x45 + 4x46 + 4x47
Transshipment Problem: Example

 Constraints Defined
Amount Out of Arnold: x13 + x14 < 75
Amount Out of Supershelf: x23 + x24 < 75
Amount Through Zeron N: x13 + x23 - x35 - x36 - x37 = 0
Amount Through Zeron S: x14 + x24 - x45 - x46 - x47 = 0
Amount Into Zrox: x35 + x45 = 50
Amount Into Hewes: x36 + x46 = 60
Amount Into Rockrite: x37 + x47 = 40

Non-negativity of Variables: xij > 0, for all i and j.

 Transshipment Problem: Example

Zrox Hewes Rockrite

Zeron N 1 5 8
Zeron S 3 4 4

Zrox Hewes Rockrite

75 ≤ 75 Zeron N 50 25 0 75
75 ≤ 75 Zeron S 0 35 40 75
50 60 40 1150
≥ ≥ ≥
50 60 40

0 = 0
0 = 0
Transshipment Problem: Example
 Solution
ZROX
Zrox 50
50

5
75 1
Zeron
75 ARNOLD
Arnold
N 5 25

8 8
Hewes
HEWES 60
35
7 3 4
Super Zeron
WASH 40
75 Shelf S
4 75
BURN
4 Rock-
Rite 40
Transshipment Problem: Example
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$8 Arnold Zeron N 75 0 5 2 2
$C$8 Arnold Zeron S 0 2 8 1E+30 2
$B$9 Supershelf Zeron N 0 4 7 1E+30 4
$C$9 Supershelf Zeron S 75 0 4 2 1E+30
$I$8 Zeron N Zrox 50 0 1 3 6
$J$8 Zeron N Hewes 25 0 5 2 2
$K$8 Zeron N Rockrite 0 3 8 1E+30 3
$I$9 Zeron S Zrox 0 3 3 1E+30 3
$J$9 Zeron S Hewes 35 0 4 2 2
$K$9 Zeron S Rockrite 40 0 4 3 10

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$14 Zeron N 0 5 0 0 75
$D$15 Zeron S 0 6 0 0 25
$D$8 Arnold 75 0 75 1E+30 0
$D$9 Supershelf 75 -2 75 25 0
$I$10 Zrox 50 6 50 0 50
$J$10 Hewes 60 10 60 0 25
$K$10 Rockrite 40 10 40 0 25
Transshipment Transformed into
Transportation Problem
Cost Table
Zeron N Zeron S Zrox Hewes Rockrite
Arnold 5 8 1000 1000 1000
Supershelf 7 4 1000 1000 1000
Zeron N 0 1000 1 5 8
Zeron S 1000 0 3 4 4
`

Decision Variable Table

Zeron N Zeron S Zrox Hewes Rockrite LHS RHS
Arnold 75 0 0 0 0 75 = 75
Supershelf 0 75 0 0 0 75 = 75
Zeron N 75 0 50 25 0 150 = 150
Zeron S 0 75 0 35 40 150 = 150
LHS 150 150 50 60 40 1150
= = = = =
RHS 150 150 50 60 40