4.

Unacceptable or Prohibited Routes

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
routes.
Minimization Problem
i. Assign a very high cost to prevent the route from ever being used in the
optimal solution.
ii. After this high cost placed in the transportation table, the problem is solved
using the techniques discussed.
Maximization Problem
The very high cost used in minimization problem is given a negative sign, turning it
into a very bad profit.
5. Assignment Model
Step 1 Find the opportunity cost table by:
a. Subtracting the smallest number in each row of the original cost table or
matrix from every number in that row.
b. Then subtracting the smallest number in each column of the table
obtained in part (a) from every number in that column
Step 2 Test the table resulting from step 1 to see whether an optimal
assignment can be made.
a. Draw the minimum number of vertical and horizontal straight lines
necessary to cover all zeros in the table
b. If the number of lines equals either the number of rows or columns in the
table, an optimal assignment can be made
c. If the number of lines is less than the number of rows or columns, then
proceed to step 3.
Step 3 Revise the present opportunity cost table.
a. Subtracting the smallest number not covered by a line from every other
12

uncovered number.
b. This same smallest number is also added to any number lying at the
intersection of horizontal and vertical lines
c. Return to step 2 and continue the cycle until an optimal assignment is
possible.
Example:
Fix-It Shop has just received three new rush projects to repair: (1) a radio, (2) a
toaster Oven, and (3) a broken coffee table. Three repair persons, each with
different talents and abilities, are available to do the jobs. The Fix-It Shop owner
estimates what it will cost in wages to assign each of the workers to each of the
three projects. The costs, which are shown in the following table, differ because the
owner believes that each worker will differ in speed and skill on these quite varied
jobs. The owners objective is to assign the three projects to the workers in a way
that will result in the lowest total cost to the shop. Note that the assignment of
people to projects must be on a one-to-one basis.
Workers
Adams
Brown
Cooper

1
$11
$8
$9

Projects
2
$14
$10
$12

3
$6
$11
$7

13

6. Unbalanced Assignment Problem

a. Number of people or objects to be assigned does not equal the number of tasks
listed in the columns.
b. When this occurs, and there are more rows than columns, simply add a
dummy column or task.
c. If the number of tasks that need to be done exceeds the number of people
available, add a dummy row.
Example
i.
Workers
James
Jimmy
Andy

1
$11
$8
$9

Projects
2
$14
$10
$12

Dummy
0
0
0

1
$11
$8
0

Projects
2
$14
$10
0

Dummy
6
11
0

ii.
Workers
Amy
Bryan
Dummy

7. Maximization Assignment Problems

a. Transform it into a minimization problem by converting all numbers in the
table to opportunity costs.
b. Subtracting every number in the original payoff table from the largest single
number in that table.

14

Exercise 9
1. The Jessie Cohen Clothing Group owns factories in three towns (W, Y and Z)
which distribute to three Cohen retail dress shops (in A, B, and C). Factory
availabilities, projected store demands, and unit shipping costs are summarized
in the table that follows:
To
Destination
Factory
Availability
Form
A
B
C
W
4
3
3
35
X
6
7
6
50
Y
8
2
5
50
Store Demand 30
65
40
135
Use the northwest corner method to find an initial feasible solution and then find
the optimal solution.
2. Solve the following transportation problem
From
To
A
B
1
6
9
2
12
3
3
4
8
Demand
80
110
M indicate that no unit should be shipped from 1 to C.

C
M
5
11
60

Supply
130
70
100

Answer: 1-B=80 units, 1-dummy=50 units, 2-B=10units, 2-C=60units,

1-A=80 units and 2-B=20 units.

15

3. The personnel director of Dollar Finance Corp. must assign three recently hired
college graduates to three regional offices. The three new loan officers are
equally well qualified, so the decision will be based on the costs of relocation the
graduates' families. Cost data are presented in the following table:
OFFICER

OFFICE
OMAHA
MIAMI
Jones
$800
$1,100
Smith
$500
$1,600
Wilson
$500
$1,000
Use the assignment algorithm to solve this problem.

DALLAS
$1,200
$1,300
$2,300

16