The Transportation Model

1
The Transportation Model
1. The transportation model is a special class of
LPPs that deals with transporting(=shipping) a
commodity from sources (e.g. factories) to
destinations (e.g. warehouses).
2. The objective is to determine the shipping
schedule that minimizes the total shipping cost
while satisfying supply and demand limits.
3. We assume that the shipping cost is proportional
to the number of units shipped on a given route.
2
We assume that there are m sources 1,2, …, m and n
destinations 1, 2, …, n. The cost of shipping one unit
from Source i to Destination j is cij.
We assume that the availability at source i is
ai (i=1, 2, …, m) and the demand at the destination j
is bj (j=1, 2, …, n). We make an important
assumption: the problem is a balanced one. That is

m n

 a  b
i 1
i
j 1
j

That is, total availability equals total demand.

3
We can always meet this condition by introducing
a dummy source (if the total demand is more than
the total supply) or a dummy destination (if the
total supply is more than the total demand).
Let xij be the amount of commodity to be shipped
from the source i to the destination j.

4
Thus the problem becomes the LPP
m n
Minimize z c ij xij
i 1 j 1

subject to
n

x
j 1
ij  ai (i  1,2,..., m)

x
i 1
ij  b j ( j  1,2,..., n)

xij  0
5
1. Thus there are mn decision variables xij and m+n
constraints.
2. Since the sum of the first m constraints equals the sum
of the last n constraints (because the problem is a
balanced one), one of the constraints is redundant and
we can show that the other m+n-1 constraints are LI.
3. Thus any BFS will have only m+n-1 nonzero
variables.
4. Though we can solve the above LPP by Simplex
method, we solve it by a special algorithm called the
transportation algorithm.
5. We present the data in an mn tableau as explained
below. 6
 Destination
1 2 . . n Supply
c11 c12 c1n
1 a1
S
o c21 c22 c2n
2 a2
u
r .
c .
e
m cm1 cm2 cmn
am
Demand b1 b2 bn

7
Formulation of Transportation Models
Example 5.1-2
MG Auto has three plants in Los Angeles, Detroit, and
New Orleans, and two major distribution centers in
Denver and Miami. The capacities of the three plants
during the next quarter are 1000, 1300 and 1200 cars. The
quarterly demands at the two distribution centers are
2300 and 1400 cars. The transportation cost per car from
Los Angeles to Denver and Miami are $80 and $215
respectively. The corresponding figures from Detroit and
New Orleans are 100, 108 and 102, 68 respectively.

8
Formulate the transportation Model.

Since the total demand = 3700 > 3500 (Total

supply) we introduce a dummy supply with
availability 3700-3500=200 units to make the
problem a balanced one. If a destination
receives u units from the dummy source, it
means that that destination gets u units less than
what it demanded. We usually put the cost per
unit of transporting from a dummy source as
zero (unless some restrictions are there). Thus
we get the transportation tableau
9
 Destination
Denver Miami Supply
80 215
S Los Angeles 1000
o 100 108
1300
Detroit
u
102 68
r New Orleans 1200
c 0 0
200
Dummy
e
Demand 2300 1400
We write inside the (i,j) cell the amount to be
shipped from source i to destination j. A blank
inside a cell indicates no amount was shipped. 10
Problem 5 Problem Set 5.1A Page 213
In the previous problem, penalty costs are levied
at the rate of $200 and $300 for each undelivered
car at Denver and Miami respectively.
Additionally no deliveries are made from the Los
Angeles plant to the Miami distribution center.
Set up the transportation model.
The above imply that the "cost" of transporting a
car from the dummy source to Denver and Miami
are respectively 200 and 300. The second condition
means we put a "high" transportation cost from
Los Angeles to Miami. We thus get the tableau 11
 Destination
Denver Miami Supply
80 M
S Los Angeles 1000
o 100 108
1300
Detroit
u
102 68
r New Orleans 1200
c 200 300
200
Dummy
e
Demand 2300 1400

Note: M indicates a very "big" positive number.

In TORA it is denoted by "infinity".
12
Problem 8 Problem Set 5.1A Page 213
Three refineries with daily capacities of 6,5, and 8
million gallons, respectively, supply three
distribution areas with daily demands of 4,8, and 7
million gallons, respectively. Gasoline is distributed
to the three distribution areas through a network of
pipelines. The transportation cost is 10 cents per
1000 gallons per pipeline mile. The table below
gives the mileage between the refineries and the
distribution areas. Refinery 1 is not connected to the
distribution area 3.
13
 Distribution Area
1 2 3
1 120 180 -
Refinery 2 300 100 80
3 200 250 120

Construct the associated transportation model.

(Solution in the next slide)

14
 Destination
Distribution Area
S 1 2 3 Supply
o 12 18 M
1 6
u 30 10 8
r Refinery 2 5
c 20 25 12
3 8
e
Demand 4 8 7

The problem is a balanced one. M indicates a

very "big" positive number.
3 3

The total cost will be 1000*  c

i 1 j 1
ij xij
15
Problem 10 Problem Set 5.1A Page 214
In the previous problem, suppose that the daily
demand at area 3 drops to 4 million gallons.
Surplus production at refineries 1 and 2 is diverted
to other distribution areas by truck. The
transportation cost per 100 gallons is $1.50 from
refinery 1 and $2.20 from refinery 2. Refinery 3
can divert its surplus production to other chemical
processes within the plant.
Formulate the problem as a transportation model.
We introduce a dummy destination. Solution follows.
16
 Destination
Distribution Area
S 1 2 3 Dummy Supply
o 1 12 18 M 15 6
u
30 10 8 22
r Refinery 2 5
c 3 20 25 12 0 8
e
Demand 4 8 4 3

M indicates a very "big" positive number.

3 3

The total cost will be 1000*  ci 1 j 1

ij xij
17
Problem 11 Problem Set 5.1 A Pages 170-171
Three orchards supply crates of oranges to four
retailers. The daily demand at the four retailers is
150,150,400, and 100 crates, respectively. Supply
at the three orchards is dictated by available
regular labor and is estimated at 150, 200, and 250
crates daily. However, both orchards 1 and 2 have
indicated that they could supply more crates, if
necessary by using overtime labor. Orchard 3 does
not offer this option. The transportation costs (in
dollars) per crate from the orchards to the retailers
are given in Table below.
18
 Retailer
1 2 3 4
1 1 2 3 2
Orchard 2 2 4 1 2
3 1 3 5 3

Formulate the problem as a transportation model.

Since the orchards 1, 2 can supply more crates with
overtime labor, we increase their capacities to
150+200=350 and 200+200=400 respectively (as
initially the total supply fell short by 200). But then to
balance the problem we add a dummy destination.
The tableau follows. 19
 Destination
Retailer
S O 1 2 3 4 Dummy Supply
o r 1 2 3 2 0
350
1
u c
h 2 2 4 1 2 0
400
r a
c 1 3 5 3 M
r 3 250
e d
Demand 150 150 400 100 200

20
Problem 8.1-9 from Hillier and Lieberman
(Introduction to Operations Research, 7th Edition)
The Build-Em-Fast Company has agreed to supply
its best customer with three widgets during each of
the next 3 weeks, even though producing them will
require some overtime work. The relevant
production data are as follows:
Week Max Production Max Production Prod Cost / unit
Regular Time Overtime Regular Time
1 2 2 $300
2 3 2 $500
3 1 2 $400 21
The cost / unit produced overtime for each week is
$100 more than for regular time. The cost of storage
is $50 / unit for each week it is stored. There is
already an inventory of 2 widgets on hand currently,
but the company does not want to retain any widgets
in inventory after the 3 weeks.
Formulate the problem as a transportation problem.

There are 6 “sources” namely widgets produced

regular time and overtime for the three weeks. Also
there are 3 “destinations” viz. demand for the three
weeks.
22
We let xij as the number of units produced regular
time in week (i+1)/2 for use in week j (i=1,3,5;
j=1,2,3). We let xij as the number of units produced
overtime in week i/2 for use in week j (i=2,4,6;
j=1,2,3). Thus
x11  x12  x13  2
x21  x22  x23  2
x31  x32  x33  3
x41  x42  x43  2
x51  x52  x53  1
x61  x62  x63  2
23
To make these equalities we add a dummy
destination and let xi4 as the amount “transported”
from Source i to this dummy. Thus the
availabilities at the 6 sources are
2,2,3,2,1,2 respectively.
The demands at the three destinations (=demand
for the three weeks) are
1,3,3 respectively (as the initial inventory is 2
widgets).
To make the problem balanced we add
demand 12 – 7 = 5 at the dummy destination.
24
The cost per unit, cij are as follows:
c11  300 c12  350 c13  400 c14  0
c21  400 c22  450 c23  500 c24  0
c31  M c32  500 c33  550 c34  0
c41  M c42  600 c43  650 c44  0
c51  M c52  M c53  400 c54  0
c61  M c62  M c63  500 c64  0

These are written in a transportation tableau.

25
 Destination
Demand for Week
1 2 3 Dummy Supply
Prod.week1 300 350 400 0
Reg time 1 2
S
Prod.week1 400 450 500 0
o Over time 2 2
u Prod.week2 3 M 500 550 0 3
Reg time
r Prod.week2
c Over time 4 M 600 650 0 2
e Prod.week3 5
M M 400 0 1
Reg time
Prod.week3
Over time 6 M M 500 0 2

Demand 1 3 3 5
26
Determination of Starting
Basic Feasible Solution

27
Determination of the starting Solution
• In any transportation model we determine a starting
BFS and then iteratively move towards the optimal
solution which has the least shipping cost.
• As mentioned earlier, any BFS will have only m+n-1
basic variables (which may assume non-zero =positive
values) and the remaining variables will all be non-
basic and so have zero values.
• In any transportation tableau, we only indicate the
values of basic variables. The cells corresponding to
non-basic variables will be blank.

28
Degenerate BFS
If in a cell we find a zero mentioned, it means that
that cell corresponds to a basic variable which
assumes a value of zero.
In simplex language, we say that we have a
degenerate BFS.

29
NORTH-WEST Corner Method for
determining a starting BFS
• The method starts at the north-west corner cell
(i.e. cell (1,1)).
• Step 1. We allocate as much as possible to the
selected cell and adjust the associated amounts
of supply and demand by subtracting the
allocated amount.
• Step 2. Cross out the row (column) with zero
supply (zero demand) to indicate that no further
assignments can be made to that row(column).
30
• If both a row and a column are
simultaneously satisfied then
• If exactly one row or column is left uncrossed
make the obvious allocations and stop. Else
cross out one only (either the row or the
column) and leave a zero supply(demand) in the
uncrossed out row(column).
• Step 3. If no further allocation is to be made,
stop. Else move to the cell to the right (if a
column has just been crossed out) or to the cell
below if a row has just been crossed out. Go to
Step 1.
31
 Consider the transportation tableau:
Destination
1 2 3 4 Supply
3 7 6 4
1 52
3 2
Source 2 4 3 2
2 1 1 21

4 3 8 5
3 1 2 3 2

Demand 3 3 1 2 1 2

Total shipping cost = 48 32

2. LEAST COST Method of determining
the starting BFS.
• In this method we start assigning as much as
possible to the cell with the least unit
transportation cost (ties are broken arbitrarily)
and the associated amounts of supply and
demand are adjusted by subtracting the allocated
amount.
• Cross out the row (column) with zero supply
(zero demand) to indicate that no further
assignments can be made to that
row(column). 33
If both a row and a column are simultaneously
satisfied then
if exactly one row or column is left uncrossed
make the obvious allocations and stop. Else cross
out one only (either the row or the column) and
leave a zero supply(demand) in the uncrossed out
row(column).
Next look for the uncrossed out cell with the
smallest unit cost and repeat the process until no
further allocations are to be made.

34
 Consider the transportation tableau:
Destination
1 2 3 4 Supply
3 7 6 4
1 1 0 2 2 54 2

Source 2 4 3 2
2 2 2

4 3 8 5
3 3 3

Demand 3 1 3 0 2 2

Total shipping cost = 36 35

3. Vogel’s approximation method (VAM)
Step 1. For each row (column) remaining under
consideration, determine a penalty by subtracting the
smallest unit cost in the row (column) from the next
smallest unit cost in the same row(column). ( If two
unit costs tie for being the smallest unit cost, then
the penalty is 0).
Step2. Identify the row or column with the largest
penalty. Break ties arbitrarily. Allocate as much as
possible to the cell with the least unit cost in the
selected row or column.(Again break the ties
arbitrarily.) Adjust the supply and demand and cross
out the satisfied row or column. 36
If both a row and a column are simultaneously
satisfied then
if exactly one row or column is left uncrossed
make the obvious allocations and stop. Else cross
out one only (either the row or the column) and
leave a zero supply (demand) in the uncrossed out
row(column). (But omit that row or column for
calculating future penalties).
Step 3. If all allocations are made, stop. Else go to
step 1.

37
 Destination
1 2 3 4 Supply Row Penalties
3 7 6 4
1 3 0 0 2 5 1 1
S
o 2 4 3 2
2 2 2 0 -
u
r 4 3 8 5
3 3 3 1 1
c
e Demand
3 3 0 20 2

1 1 3 2
Column
Penalties 1 4 - 1

Total shipping cost = 32 38

Iterative computations
of the Transportation
algorithm

39
Iterative computations of the Transportation
algorithm
• After determining the starting BFS by any one of
the three methods discussed earlier, we use the
following algorithm to determine the optimum
solution
• Step1: Use the Simplex optimality condition to
determine the entering variable as a current non-
basic variable that can improve the solution. If the
optimality condition is satisfied by all non-basic
variables, the current solution is optimal and we
stop. Otherwise we go to Step 2.
40
Step 2. Determine the leaving variable using the
Simplex feasibility condition. Change the basis
and go to Step 1.

The determination of the entering variable from

among the current non-basic variables is done by
the method of multipliers.

In the method of multipliers, we associate with

each row a dual variable (also called a
multiplier) ui and with each column we
associate a dual variable (also called a
multiplier) vj. 41
 Noting that each row corresponds to a constraint
and each column corresponds to a constraint we
recall from duality theory that

At any simplex iteration ,

Primal z-equation Left hand side Right hand side
coefficient of = of corresponding - of corresponding
variable xj dual constraint dual constraint

That is " zij  cij "  ui  v j  cij

(Verify this by taking m=3 and n=4 !)
42
Since there are m+n-1 basic variables and since
zij  cij  0
for all such basic variables, we have m+n-1
equations u v  c
i j ij

to determine the m+n variables ui , v j

We arbitrarily choose one of them and equate to
zero and determine the remaining m+n-1 of
them. Then we calculate zij  cij  ui  v j  cij
for all non-basic variables xij. Then the entering
variable is that one for which ui  v j  cij
is most positive. 43
We do all this on the
transportation tableau itself (and
NOT separately) as the following
example shows.

44
 Destination
Starting Tableau Total Cost =48
v1=3 v2=7 v3=6 v4=3 Supply
3 7 6 4
S u1=0 5
3 2 0 -1
o
2 4 3 2
u u2= -3 1 1 2
r -2 -2
c 4 3 8 5
u3= 2 1 2 3
e 1 6

Demand 3 3 2 2

Thus x32 enters the basis. 45

Determining the leaving variable
We first construct a closed loop that starts and ends at the
entering variable cell.
The loop consists of connected horizontal and vertical
segments only (no diagonals are allowed).
Except for the entering variable cell, each vertex (or
corner) of the closed loop must correspond to a basic
variable cell.
The loop can cross itself and bypass one or more basic
variables. The amount  to be allocated to the entering
variable cell is such that it satisfies all the demand and
supply restrictions and must be non-negative.
46
• Usually  is the minimum of the amounts allocated
to the basic cells adjacent to the entering variable
cell.
• Having decided about the amount  to be allocated
to the entering cell, for the supply and demand limits
to remain satisfied, we must alternate between
subtracting and adding the amount  at the
successive corners of the loop.
• In this process one of the basic variables will drop to
zero. In simplex language, we say it leaves the basis.
We repeat this process till optimality is reached. We
illustrate with a numerical example.
47
 Destination
Starting Tableau Total Cost =48
v1=3 v2=7 v3=6 v4=3 Supply
3 7 6 4
S u1=0 5
3 2 0 -1
o
2 4 3 2
u u2= -3 1 1 2
r -2 -2
c 4 3 8 5
u3= 2  1 2 3
e 1 6

Demand 3 3 2 2

Thus x32 enters the basis. 48

Thus  will become 1 and in the process both the
basic variables x22 and x33 will become
simultaneously zero. Since only one of them should
leave the basis we make x22 leave the basis and
keep x33 in the basis but with value zero. Thus the
transportation cost reduces by 6 (as x23 increases
by 1) and we say one iteration is over. The resulting
new tableau is on the next slide.

49
 Destination
Start of Iteration 2 Total Cost =42
v1=3 v2=7 v3=12 v4=9 Supply
3 7 6 4
S u1=0 3 2  5
o 6 5
2 4 3 2
u u2= -9 2 2
r -8 -6 -2
c 4 3 8 5
u3= -4 1 0 2 3
e -5

Demand 3 3 2 2

Thus x13 enters the basis. 50

Thus  will become 0 and x32 leaves the basis.
Again the BFS is degenerate . But the
transportation cost remains the same and we say
the second iteration is over. The resulting new
tableau is on the next slide.

51
 Destination
Start of Iteration 3 Total Cost =42
v1=3 v2=7 v3=6 v4=9 Supply
3 7 6 4
S u1=0 3 2 0  5
o 5
2 4 3 2
u u2= -3 2 2
r -2 0 4
c 4 3 8 5
u3= -4 1 2 3
e -5 -6

Demand 3 3 2 2

Thus x14 enters the basis. 52

Sometimes it might be difficult to find the closed
loop from the entering cell by inspection. In that
case the following method can be used to find the
closed loop. We sketch the flowchart of the
sequence in which the variables ui and vj were
determined. For example in the above case the
flowchart is on the next slide. Now to find the
loop emanating from the non-basic cell (1,4), join
u1 and v4 by a dotted line (as shown). Then the
closed loop is:
(1,4) (1,2) (2,3) (3,4) (1,4)
53
 v1=3

u1=0 v2=7 u3= -4 v4= 9

v3=6 u2= -9
Thus the closed loop is
(1,4) (1,2) (2,3) (3,4) (1,4)
54
Thus  will become 2 and in the process both the
basic variables x12 and x32 will become
simultaneously zero. Since only one of them should
leave the basis we make x32 leave the basis and
keep x12 in the basis but with value zero. Also x32
becomes 3. Thus the transportation cost reduces by
1*2+4*2=10 and we say third iteration is over. The
resulting new tableau is on the next slide.

55
 Destination
Start of Iteration 4 Total Cost =32
v1=3 v2=7 v3=6 v4=4 Supply
3 7 6 4
S u1=0 3 0 0 2 5
o
2 4 3 2
u u2= -3 2 2
r -2 0 -1
c 4 3 8 5
u3= -4 3 3
e -5 -6 -5

Demand 3 3 2 2

Thus this is the optimal tableau. Alt Opt solutions exist. 56

Problem 4 Problem Set 5.3B Page 232
In the unbalanced transportation problem given in
the table below, if a unit from a source is not
shipped out (to any of the destinations) a storage
cost is incurred at the rate of $5, $4, and $3 per unit
for sources 1,2, and 3 respectively. Additionally all
the supply at source 2 must be shipped out
completely to make room for a new product. Use
VAM to determine the starting solution and
determine the optimum solution.

57
 1 2 3
1 1 2 1 20
2 3 4 5 40
3 2 3 3 30
30 20 20
To balance the problem, we introduce a dummy
destination with transportation costs
$5, $M, $3 respectively.

(Solution in the next slide) 58

 Destination
1 2 3 Dummy Supply Row Penalties
1 2 1 5
1 20 20 0 - - -
S
o 3 4 5 M
2 30 10 40 10 1 1 1 1
u
r 2 3 3 3
3 10 0 20 30 10 1 11 0
c
e Demand 30 20 10 20 0 20

1 1 2 2
Column
Penalties 1 1 - M-3
1 1 - -
- 1 - -
Total shipping cost = 240
59
 Destination
Starting Tableau Total Cost =240
v1=2v2=3 v3=3 v4=3 Supply
1 2 1 5
S u1=-2 20 20
o -1 -1 -4
3 4 5 M
u u2= 1 30 10 40
r -1 4-M
c 2 3 3 3
u3= 0 10 0 20 30
e 0

Demand 30 20 20 20

Thus this is the optimal tableau. Alt Opt solutions exist.

60
 Problem 5 Problem Set 5.3 B Page 232

In a 33 transportation problem, let xij be the

amount shipped from source i to destination j and
cij be the corresponding transportation cost per
unit. The amounts of supply at sources 1, 2, and 3
are 15, 30, and 85 units, respectively; and the
demands at destinations 1, 2, and 3 are 15, 30, and
85 units, respectively. Assume that the northwest
corner solution is optimal and that the associated
values of the multipliers are

61
given by u1 = -2, u2 = 3, u3 = 5, v1 = 2, v2 =
5, and v3 = 10.
(a) Find the associated optimal cost
(b) Determine the smallest values of cij
associated with each non-basic variable
that will maintain the optimality of the
northwest corner solution.

62
 Supply
v1=2 v2=5 v3=10
0 15 ≥3 ≥8 15
u1=-2
5 8 ≥13 30
u2=3 5 25
25
≥7 10 15 80
85
5
u3=5
Demand
20 5 30 5 80

Associated cost = 1475

63
Problem 8.1-6 Page 393 Hillier and Lieberman
(Operations Research 7th Edition)
The Onenote Co. produces a single product at
three plants for four customers. The three plants
will produce 60, 80, and 40 units respectively. The
firm has made a commitment to sell 40 units to
customer 1, 60 units to customer 2, and at least 20
units to customer 3. Both customers 3 and 4 also
want to buy as many of the remaining units as
possible. The net profit associated with shipping a
unit from plant i to customer j is given by the
following table. 64
 Customer
1 2 3 4
1 $800 $700 $500 $200
Plant 2 $500 $200 $100 $300
3 $600 $400 $300 $500

Management wants to know how many units to sell to

customers 3 and 4 and how many units to ship from
each of the plant to each of the customers to maximize
profits. Formulate the problem as a transportation
model and solve it.
65
There are 3 sources, viz. Plants 1, 2 and 3. Right
now there are 4 destinations, viz. customers 1, 2, 3,
and 4. The supplies ai at the three sources are 60,
80, and 40 respectively. The demands at the three
destinations are: b1 = 40, b2 = 60, b3  20, b4 = ?
Since in a transportation model, all constraints are
equalities, we shall put b3 = 80 ( since customer 3
must get at least 20 units) and b4= 60 as the supply
remaining after satisfying the three customers 1, 2,
and 3 is 60 and since customers 3 and 4 will buy as
much as possible.
66
But now the demand has become 240 and so we
introduce a dummy source SF with supply 60. Since
the customers 1, 2 must definitely get 40 and 60 units
respectively, the dummy source cannot send any
amount to these destinations. This is achieved by
putting the cost from the dummy to these destinations
as big M. Now the cost from dummy to the
destinations 3 and 4 are put as zero. Also since these
are actually profits, and since the transportation model
is a minimization problem, to maximize the total profit
we take cij as negative of the profits given. The
starting tableau is given below.
67
 Destination
1 2 3 4 Supply
1 -8 -7 -5 -2
60 0 60 0 1 - - -
S -5 -2 -1 -3
2 80 40 2 2 2 -
o 40 40
u 3 -6 -4 -3 -5
20 20 40 20 1 1 2 2
r
SF M M 0 0
c 60 60 0 0 0 0
e
Demand 40 60 80 6020

2 3 2 2
1 - 2 2
- - 2 2
- - 3 5
68
 Destination
v1= -9 v2= -7 v3= -5 v4= -7

u1= 0 -8 -7 -5 -2
S -1 60 0 -5

u2= 4 -5 -2 -1 -3
o
u 40 -5 0 40
r -6 -4 -3 -5
u3= 2 20 20
c -1 -9
e M M 0 0
u4= 5 60
-4-M -2-M -2

This is the optimal tableau.

Max Profit = - min z = - (-900) = $900.

69
 Compre Question I Semester 2003-2004
The table below gives the times taken by 3 persons
to complete 4 tasks( i.e. cell (i,j) is the time taken
by person i to complete the task j).
Tasks
1 2 3 4
1 4 1 2 6
Person 2 6 4 3 5
3 5 2 6 4

70
If each task is to be allocated to a person (i.e. no
splitting of the task between 2 or more persons is
allowed) and if each person can be assigned at most
two tasks, find the optimum allocation of the jobs to
the persons to minimize the total time taken to
complete all the 4 tasks.
This can be formulated as a transportation model with
three sources (persons) and 4 destinations (tasks). The
demands at the three destinations are bj = 1 for
j=1,2,3,4. But the availabilities are ai = 2 for i=1, 2, 3
as each person can be assigned a maximum of two
tasks. Thus to balance the problem, we introduce a
dummy task with demand 2 and time 0. Thus we get
the starting tableau: 71
 Destination
Starting Tableau
1 2 3 4 Dummy Supply
S
o 1 4 11 2 1 6 0 2 1 1 1 3
u 2 6 4 3 5 0 2 2 3 - -
r
c 3 5 1
2 0
6 4 1 0 0 2 2 22
e
Demand 1 1 0 1 1 2 0

1 1 1 1 0
1 1 4 2 -
1 1 - 2 -
72
 Destination
Starting Tableau
v1=5 v2=2 v3=3 v4=4 v5=0 Supply
S 4 1 2 6 0
o u1= -1 1 1 2
0 -3 -1
u
6 4 3 5 0
r u2= 0 2 2
c -1 -2 0 -1
e 5 2 6 4 0
2
0
u3= 0 1 0 1
-3
Demand 1 1 1 1 2

Thus this is the optimal tableau. Optimal cost = 12 73