BA 35: Management Science

Unit IV.
TRANSPORTATION AND ASSIGNMENT
METHODS

ERROL JOHN V. VALDEZ

CHARITO B. JULIAN
Business Administration Department
College of Business, Economics and Accountancy
Mariano Marcos State University
Contents
Topics:
A. Transportation Method
1. Balanced Problem
2. Special Cases
a. Degeneracy
b. Unbalanced
c. Multiple Optimal Solution
B. Assignment Method
1. Minimization Problem
2. Maximization problem
3. Special Cases
a. Unbalanced
b. Multiple Optimal Solution
Contents
At the end of the unit, the student must have:
1. solved transportation problem using the north-west corner
method; and
2. solved assignment problems with the Hungarian
(matrix reduction) method.
Lesson

INTRODUCTION
Lesson
Introduction

Network flow problems

Transportation Method

Assignment Method
Lesson

A.Transportation Method
Lesson
Transportation Method
items are allocated from sources to destinations at a minimum cost

each source is able to supply a fixed number of units of the product

each destination has a fixed demand for the product

Lesson
Transportation Method
 The objective is to find the least cost of transporting product from multiple shipping points to
multiple destination points.
Destination
Shipping Points
Points

Laoag Vigan

Batac Sinait

Paoay Bantay

11/11/2024 8
Lesson
Important Information Needed
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158

2A 6 2B 24 2C 16
2 184

3A 8 3B 16 3C 24
3 179

DEMAND 174 204 143 521

11/11/2024 9
Lesson
Transportation Method - Algorithm

Set up the transportation Is the current YES Optimal solution is

table and establish an initial solution
achieved
feasible solution optimal?

NO

Move to better feasible solution

11/11/2024 10
Lesson
Northwest-corner Method
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY Developing the Initial Feasible
POINTS A B C
Solution using the Northwest-corner
1A 4 1B 8 1C 8 method
1 158
158 1) Exhaust the supply at each row
before moving down to the next
2A 6 2B 24 2C 16
2 184 row.
16 168 2) Supply the demand of each
3A 8 3B 16 3C 24 column before moving to the right
3 179 to the next column.
36 143 3) Check that all supply are
exhausted and demands are met.
DEMAND 174 204 143 521

11/11/2024 11
Lesson
Northwest-corner Method
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
158
2A 6 2B 24 2C 16
2 184
16 168
3A 8 3B 16 3C 24 The initial feasible solution
3 179 obtained by means of the
36 143
northwest corner method has a
STAIRCASE APPEARNCE.
DEMAND 174 204 143 521

11/11/2024 12
Lesson
Checking for Degeneracy
No. of Occupied cells = (No. of Shipping points + No. of Destination points) - 1
TABLE 1 SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
158
5 = (3 + 3) – 1
2A 6 2B 24 2C 16 5 = 5 : No problem exist
2 184
16 168
3A 8 3B 16 3C 24
3 179 Degeneracy exist if
36 143 O.C.  (R + C) - 1

DEMAND 174 204 143 521

11/11/2024 13
Lesson
Computation for the Transportation Cost
TABLE 1

SP-DP Unit Shipped x Unit Cost = Cost

1A 158 x 4 = 632.00
2A 16 x 6 = 96.00
2B 168 x 24 = 4,032.00
3B 36 x 16 = 576.00
3C 143 x 24 = 3,432.00
Total Transportation Cost: 8,768.00

11/11/2024 14
Lesson
Testing for Optimality: Stepping Stone Method
Testing the solution for possible improvement. Look for the unoccupied cells.
TABLE 1 Steps to Test Unused Squares or Cells:
DESTINATION POINTS
SHIPPING 1) Select an unusedSUPPLYsquare to be evaluated.
POINTS A B 2) From C the selected square, trace a CLOSE PATH back to the
1A 4 1B 8 1Coriginal 8square via occupied squares, moving strictly in
1 158
Vertical-Horizontal-Vertical-Horizontal movements. Make
158 sure you land in an OCCUPIED SQUARE. Diagonal movement
2A 6 2B 24 2Cis not allowed.
16
2 3) Assign a “+” sign 184
in the selected square (step 1), move
16 168
vertically to an occupied square and assign a “–” sign then
3A 8 3B 16 3Cmove horizontally
24 to an occupied square and assign “+” sign,
3 179
36 repeat
143 the process until you land in the original cell (selected
square). Do this to all unused squares.
DEMAND 174 204 4) Compute
143 for improvement
521 indices.
5) The square with the most negative value needs
improvement. In case, all of the improvement indices are
3A, 1B, 1C, 2C are
zero andthe cellsthen
positive that
an need
optimalto be checked
solution for
is achieved.

11/11/2024 possible improvement. 15

Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
158
2A 6 2B 24 2C 16
2 184
16 (-) 168 (+)
3A 8 3B 16 3C 24 Computation for Improvement index for the
3 179 cell involved
(+) 36 (-) 143
3A:
DEMAND 174 204 143 521
+8 – 6 +24 – 16 = 10

11/11/2024 16
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
158 (-) (+)
2A 6 2B 24 2C 16
2 184
16 (+) 168 (-)
3A 8 3B 16 3C 24 Computation for Improvement index for the
3 179 cell involved
36 143
1B:
DEMAND 174 204 143 521
+8 – 24 + 6 – 4 = -14

11/11/2024 17
Lesson
TABLE 1

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
158 (-) (+)
2A 6 2B 24 2C 16
2 184
16 (+) 168 (-)
3A 8 3B 16 3C 24 Computation for Improvement index for
3 179 the cell involved
36 (+) 143 (-)
1C:
DEMAND 174 204 143 521
+8 – 24 + 16 – 24 + 6 – 4 = -22

11/11/2024 18
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
158
2A 6 2B 24 2C 16
2 184
16 168 (-) (+)
3A 8 3B 16 3C 24 Computation for Improvement index
3 179 for the cell involved
36 (+) 143 (-)
2C:
DEMAND 174 204 143 521
+16 – 24 + 16 – 24 = -16

11/11/2024 19
Lesson
TABLE 1

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C SP - DP Computations Improve
1A 4 1B 8 1C 8 ment
1 158 Index
158 (-) (+)
2A 6 2C 3A 8 – 6 + 24 – 16 10
2B 24 16
2 184 1B 8 – 24 + 6 – 4 -14
16 (+) 168 (-)
3A 8 3B 16 3C 24 1C 8 – 24 +16 – 24 + 6 – 4 -22
3 179 2C 16 – 24 + 16 – 24 -16
36 (+) 143 (-)

DEMAND 174 204 143 521 The cell with the most negative improvement
index is the cell that needs improvement.

11/11/2024 20
 Lesson
TABLE 1

SHIPPING DESTINATION POINTS Computation of

Computation of Load
New for
Loadsthe square that
SUPPLY needs
POINTS A B C SP-DPimprovement
Computations New Loads
1)1C Retrace the0 close path of the square
1A 4 1B 8 1C 8 + 143 = 143
that needs improvement. 15
1 158 1A 158 - 143 =
158 (-) (+) 2) Determine the cell with the SMALLEST
2A 16 + 143 = 159
STONE in a NEGATIVE POSITON.
2A 6 2B 24 2C 16 143 =to the25
2 184
2B Smallest168stone- refers smallest
16 (+) 168 (-) 3B load in the + 143 cells.
36 occupied = 179
3)3C The smallest - 143is =added 0to the
143 stone
3A 8 3B 16 3C 24
3 179 cells in “+” positions and deducted
36 (+) 143 (-) from the cells in “-” position
4) Plot the new loads.
DEMAND 174 204 143 521

11/11/2024 21
Lesson
TABLE 2
DESTINATION POINTS Computation of New Loads
SHIPPING
SUPPLY
POINTS A B C SP-DP Computations New Loads
1A 4 1B 8 1C 8 1C 0 + 143 = 143
1 158 1A 158 - 143 = 15
15 143
2A 16 + 143 = 159
2A 6 2B 24 2C 16 2B 168 - 143 = 25
2 184
159 25 3B 36 + 143 = 179
3C 143 - 143 = 0
3A 8 3B 16 3C 24
3 179
179
To check for degeneracy:
# O.C = (R+C) –1
DEMAND 174 204 143 521
5 = (3+3)-1
5=5
No problem exist.

11/11/2024 22
 Lesson
TABLE 2
Unit Shipped
SP-DP x Unit Cost = Cost
1A 15 x 4 = 60.00
2A 159 x 6 = 954.00
2B 25 x 24 = 600.00
3B 179 x 16 = 2,864.00
1C 143 x 8 = 1,144.00
Total Transportation Cost: 5,622.00

11/11/2024 23
Lesson
TABLE 2
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 143
2A 6 2B 24 2C 16
2 184
159 (-) 25 (+)
Computation of Improvement
3A 8 3B 16 3C 24 Index for the cell involved
3 179
(+) 179 (-)
3A:
DEMAND 174 204 143 521 +8 – 6 + 24 – 16 =10

11/11/2024 24
Lesson
TABLE 2

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 (-) (+) 143
2A 6 2B 24 2C 16
2 184
159 (+) 25 (-)
3A 8 3B 16 3C 24 Computation of Improvement Index for the
3 179 cell involved
179
3A: +8 – 6 + 24 – 16 =10
DEMAND 174 204 143 521
1B: +8 – 24 + 6 – 4 = -14

11/11/2024 25
Lesson
TABLE 2

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
Computation of Improvement Index for the
1A 4 1B 8 1C 8
1 158 cell involved
15 (+) 143 (-)
2A 2C
3A: +8 – 6 + 24 – 16 =10
6 2B 24 16
2 184 1B: +8 – 24 + 6 – 4 = -14
159 (-) 25 (+)
2C: +16 – 8 + 4 – 6 = 6
3A 8 3B 16 3C 24
3 179
179

DEMAND 174 204 143 521

11/11/2024 26
Lesson
TABLE 2

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8 Computation of Improvement Index
1 158
15 (+) 143 (-) for the cell involved
2A 6 2B 24 2C 16
2
159 25
184 3A: +8 – 6 + 24 – 16 =10
(-) (+)
1B: +8 – 24 + 6 – 4 = -14
3A 8 3B 16 3C 24
3 179 2C: +16 – 8 + 4 – 6 = 6
179 (-) (+)
3C: +24 – 8 + 4 – 6 + 24 – 16 = 22
DEMAND 174 204 143 521

11/11/2024 27
Lesson
TABLE 2

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 (-) (+) 143 Computation of New Loads
2A 6 2B 24 2C 16 SP-DP Computations New Loads
2 184
159 (+) 25 (-) 1B 0 + 15 15
3A 8 3B 16 3C 24
3 179 2B 25 – 15 10
179
2A 159 +15 174
DEMAND 174 204 143 521 1A 15 - 15 0

11/11/2024 28
Lesson
TABLE 3
Computation of New Loads
SHIPPING DESTINATION POINTS
SUPPLY SP-DP Computations New Loads
POINTS A B C
1B 0 + 15 15
1A 4 1B 8 1C 8
1 158 2B 25 – 15 10
15 143
2A 6 2B 24 2C 16 2A 159 +15 174
2 184
174 10 1A 15 - 15 0
3A 8 3B 16 3C 24
3
179
179 Check for Degeneracy
# O.C. = (R + C) – 1
DEMAND 174 204 143 521 5 = (3 + 3) – 1
5=5
No problem exist.

11/11/2024 29
Lesson
TABLE 3
SP-DP Unit Shipped x Unit Cost = Cost
1B 15 X 8 = 120.00
1C 143 X 8 = 1,144.00
2A 174 X 6 = 1,044.00
2B 10 X 24 = 240.00
3B 179 X 16 = 2,864.00
Total Transportation Cost: 5,412.00

11/11/2024 30
Lesson
TABLE 3

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
(+) 15 (-) 143
2A 6 2B 24 2C 16
2 184
174 (-) 10 (+)
3A 8 3B 16 3C 24
3 179
179
Computation of Improvement Indices
DEMAND 174 204 143 521 1A: +4 – 6 + 24 – 8 = 14

11/11/2024 31
Lesson
TABLE 3

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 143
2A 6 2B 24 2C 16
2 184
174 (-) 10 (+)
3A 8 3B 16 3C 24
3 179
(+) 179 (-) Computation of Improvement Indices
1A: +4 – 6 + 24 – 8 = 14
DEMAND 174 204 143 521
3A: +8 – 6 + 24 – 16 = 10

11/11/2024 32
Lesson
TABLE 3

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 (+) 143 (-)
2A 6 2B 24 2C 16
2 184
174 10 (-) (+)
3A 8 3B 16 3C 24 Computation of Improvement Indices
3 179
179 1A: +4 – 6 + 24 – 8 = 14
3A: +8 – 6 + 24 – 16 = 10
DEMAND 174 204 143 521
2C: +16 – 8 + 8 – 24 = -8

11/11/2024 33
Lesson
TABLE 3

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 (+) 143 (-)
2A 6 2B 24 2C 16
2 184
174 10 Computation of Improvement Indices
3A 8 3B 16 3C 24 1A: +4 – 6 + 24 – 8 = 14
3 179
179 (-) (+) 3A: +8 – 6 + 24 – 16 = 10
2C: +16 – 8 + 8 – 24 = -8
DEMAND 174 204 143 521
3C: +24 – 8 + 8 -16 = 8

11/11/2024 34
Lesson
TABLE 3

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
15 (+) 143 (-) Computation of New Load
2A 6 2B 24 2C 16 SP-DP Computations New Loads
2 184
174 10 (-) (+) 2C 0 + 10 10
3A 8 3B 16 3C 24
3 179 1C 143 – 10 133
179
1B 15 + 10 25
DEMAND 174 204 143 521 2B 10 - 10 0

11/11/2024 35
Lesson
TABLE 4
Computation of New Load
SHIPPING DESTINATION POINTS
SUPPLY SP-DP Computations New Loads
POINTS A B C
2C 0 + 10 10
1A 4 1B 8 1C 8
1 158 1C 143 – 10 133
25 133
2A 6 2B 24 2C 16 1B 15 + 10 25
2 184
174 10 2B 10 - 10 0
3A 8 3B 16 3C 24
3 179 Checking for Degeneracy
179
#O.C. = (R + C) – 1
5 = (3 + 3) -1
DEMAND 174 204 143 521
5=5
No problem exist.

11/11/2024 36
Lesson
TABLE 4
SP-DP Unit Shipped x Unit Cost = Cost
1B 25 X 8 = 200.00
1C 133 X 8 = 1,064.00
2A 174 X 6 = 1,044.00
2C 10 X 16 = 160.00
3B 179 X 16 = 2,864.00
Total Transportation Cost: 5,332.00

11/11/2024 37
Lesson
TABLE 4

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
(+) 25 133 (-)
2A 6 2B 24 2C 16
2 184
174 (-) 10 (+)
3A 8 3B 16 3C 24
3 179
179
Computation of improvement indices
DEMAND 174 204 143 521 1A: +4 – 6 + 16 – 8 = 6

11/11/2024 38
Lesson
TABLE 4

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
25 (+) 133 (-)
2A 6 2B 24 2C 16
2 184
174 (-) 10 (+)
3A 8 3B 16 3C 24
3 179
(+) 179 (-) Computation of improvement indices
1A: +4 – 6 + 16 – 8 = 6
DEMAND 174 204 143 521
3A: +8 – 6 + 16 – 8 + 8 – 16 = 2

11/11/2024 39
Lesson
TABLE 4

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 4 1B 8 1C 8
1 158
25 (-) 133 (+)
2A 6 2B 24 2C 16
2 184
174 (+) 10 (-)
3A 8 3B 16 3C 24 Computation of improvement indices
3 179
179 1A: +4 – 6 + 16 – 8 = 6
3A: +8 – 6 + 16 – 8 + 8 – 16 = 2
DEMAND 174 204 143 521
2B: +24 – 8 + 8 – 16 = 8

11/11/2024 40
Lesson
TABLE 4
Computation of improvement indices
SHIPPING DESTINATION POINTS
SUPPLY 1A: +4 – 6 + 16 – 8 = 6
POINTS A B C
1A 4 8 1C 8 3A: +8 – 6 + 16 – 8 + 8 – 16 = 2
1B
1 158 2B: +24 – 8 + 8 – 16 = 8
25 (+) 133 (-)
2A 6 24 2C 16 3C: +24 – 8 + 8 – 16 = 8
2B
2 184 Criterion for optimality:
174 10
An optimal solution is achieved if all the
3A 8 3B 16 3C 24 improvement indices are zero and positive
3 179
179 (-) (+) values

DEMAND 174 204 143 521 Since all of the improvement indices
are positive numbers then an optimal
solution is achieved.

11/11/2024 41
Lesson
TABLE 4
OPTIMAL SOLUTION:
SP-DP No. of Shipping Cost Transportation
Loads per unit Cost
SP1 – DP B 25 units 8 200.00
SP1 – DP C 133 units 8 1,064.00
SP2 – DP A 174 units 6 1,044.00
SP2 – DP C 10 units 16 160.00
SP3 – DP B 179 units 16 2,864.00
TOTAL TRANSPORTATION COST: 5,332.00

11/11/2024 42
BA 35: MANAGEMENT SCIENCE

TRANSPORTATION METHOD
Special Cases

ERROL JOHN V. VALDEZ

CHARITO B. JULIAN
Business Administration Department
College of Business, Economics and Accountancy
Mariano Marcos State University
Lesson
DEGENERACY
 It occurs when
No. of Occupied Cells < (R + C) – 1

Treatments:
1) If degeneracy occurs in the initial table (Table 1):
 Assign zero stone to one of the unused cells so that not to break the Northwest corner method
(staircase step pattern). It would be better to place the zero stone in the smaller or lower
transportation cost.
2) If degeneracy will occur in the succeeding tables, the zero stone is assigned to the smallest cost in
the unoccupied cell.
 Treat the new zero square as an occupied cell and follow the procedures in the normal
problem.

11/11/2024 44
Lesson
DEGENERACY
TABLE 1

SHIPPING DESTINATION POINTS Checking for Degeneracy

SUPPLY
POINTS A B C # O.C = (R+C) - 1
1A 8 1B 2 1C 6 4 < (3+3)-1
1 100
100 0 4<5
2
2A 10 2B 9 2C 9
120
Degeneracy exists.
100 20
3A 7 3B 10 3C 7
3 80
80

DEMAND 100 100 100 300

11/11/2024 45
Lesson
SP-DP Unit Shipped x Unit Cost = Cost
1A 100 X 8 = 800.00
2B 100 X 9 = 900.00
2C 20 X 9 = 180.00
3C 80 X 7 = 560.00
1B 0X2 = 0.00
Total Transportation Cost: 2,440.00

11/11/2024 46
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
100 0 (-) (+)
2A 10 2B 9 2C 9
2 120
100 (+) 20 (-)
3A 7 3B 10 3C 7 Computation for Improvement index for the
3 80 cell involved
80
1C: +6 – 9 + 9 – 2 = 4
DEMAND 100 100 100 300

11/11/2024 47
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
100 (-) 0 (+)
2A 10 2B 9 2C 9
2 120
(+) 100 (-) 20
3A 7 3B 10 3C 7
3 80 Computation for Improvement index for the
80 cell involved
1C: +6 – 9 + 9 – 2 = 4
DEMAND 100 100 100 300
2A: +10 – 8 + 2 – 9 = -5

11/11/2024 48
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
100 (-) 0 (+)
2A 10 2B 9 2C 9
2 120
100 (-) 20 (+)
Computation for Improvement index for
3A 7 3B 10 3C 7
3 80 the cell involved
(+) 80 (-) 1C: +6 – 9 + 9 – 2 = 4
2A: +10 – 8 + 2 – 9 = -5
DEMAND 100 100 100 300
3A: +7 – 8 + 2 – 9 + 9 – 7 = - 6

11/11/2024 49
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
100 0
2A 10 2B 9 2C 9
2 120
100 (-) 20 (+) Computation for Improvement index for
the cell involved
3A 7 3B 10 3C 7
3 80 1C: +6 – 9 + 9 – 2 = 4
(+) 80 (-)
2A: +10 – 8 + 2 – 9 = -5
DEMAND 100 100 100 300 3A: +7 – 8 + 2 – 9 + 9 – 7 = - 6
3B: +10 – 9 + 9 – 7 = 3

11/11/2024 50
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
100 (-) 0 (+)
2A 10 2B 9 2C 9
2 120 Computation for Improvement index
100 (-) 20 (+) for the cell involved
3A 7 3B 10 3C 7 1C: +6 – 9 + 9 – 2 = 4
3 80
(+) 80 (-) 2A: +10 – 8 + 2 – 9 = -5
3A: +7 – 8 + 2 – 9 + 9 – 7 = - 6
DEMAND 100 100 100 300
3B: +10 – 9 + 9 – 7 = 3

11/11/2024 51
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
100 (-) 0 (+) Computation for New Load
2A 10 2B 9 2C 9 SP-DP Computation New Load
2 120 3A 0 + 80 80
100 (-) 20 (+)
1A 100 – 80 20
3A 7 3B 10 3C 7
3 80 1B 0 + 80 80
(+) 80 (-)
2B 100 – 80 20
2C 20 + 80 100
DEMAND 100 100 100 300
3C 80 – 80 0

11/11/2024 52
Lesson
TABLE 2
Computation for New Load
SHIPPING DESTINATION POINTS
SUPPLY SP-DP Computation New Load
POINTS A B C
3A 0 + 80 80
1A 8 1B 2 1C 6 1A 100 – 80 20
1 100
20 80 1B 0 + 80 80
2A 10 2B 9 2C 9 2B 100 – 80 20
2 120
20 100 2C 20 + 80 100

3A 3B 3C 3C 80 – 80 0
7 10 7
3 80
80 Check for Degeneracy
5 = (3 + 3) – 1
DEMAND 100 100 100 300 5=5
No problem exist.

11/11/2024 53
Lesson
SP-DP Unit Shipped x Unit Cost = Cost
1A 20 X 8 = 160.00
1B 80 X 2 = 160.00
2B 20 X 9 = 180.00
2C 100 X 9 = 900.00
3A 80 X 7 = 560.00
Total Transportation Cost: 1,960.00

11/11/2024 54
Lesson
TABLE 2
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
20 (-) 80 (+)
2A 10 2B 9 2C 9
2 120
(+) 20 (-) 100
3A 7 3B 10 3C 7
3 80
80
Computation for Improvement Indices
DEMAND 100 100 100 300 2A: +10 – 8 + 2 – 9 = -5

11/11/2024 55
Lesson
TABLE 2
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
20 (+) 80 (-)
2A 10 2B 9 2C 9
2 120
20 100
3A 7 3B 10 3C 7 Computation for Improvement Indices
3 80
80 (-) (+) 2A: +10 – 8 + 2 – 9 = -5
1C: +6 – 9 + 9 – 2 = 4
DEMAND 100 100 100 300
3B: +10 – 2 + 8 – 7 = 9

11/11/2024 56
Lesson
TABLE 2
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6
1 100
20 (-) 80 (+)
2A 10 2B 9 2C 9
2 120
(+) 20 (-) 100 Computation for Improvement Indices
3A 7 3B 10 3C 7 2A: +10 – 8 + 2 – 9 = -5
3 80
80 1C: +6 – 9 + 9 – 2 = 4
3B: +10 – 2 + 8 – 7 = 9
DEMAND 100 100 100 300
3C: +7 – 9 + 9 – 2 + 8 – 7 = 6

11/11/2024 57
Lesson
TABLE 2
SHIPPING DESTINATION POINTS Computation for New Load
SUPPLY
POINTS A B C SP-DP Computation New Load
1A 8 1B 2 1C 6 2A 0 + 20 20
1 100
20 (-) 80 (+) 1A 20 – 20 0
2A 10 2B 9 2C 9 1B 80 + 20 100
2 120
(+) 20 (-) 100 2B 20 – 20 0
3A 7 3B 10 3C 7
3 80
80

DEMAND 100 100 100 300

11/11/2024 58
Lesson
TABLE 3
SHIPPING DESTINATION POINTS Computation for New Load
SUPPLY
POINTS A B C SP-DP Computation New Load
1A 8 1B 2 1C 6 2A 0 + 20 20
1 100
100 0 1A 20 – 20 0
2A 10 2B 9 2C 9 1B 80 + 20 100
2 120
20 100 2B 20 – 20 0
3A 7 3B 10 3C 7
3 80 Checking for Degeneracy
80
4 < (3+3)-1
DEMAND 100 100 100 300 4<5
Degeneracy exist

11/11/2024 59
Lesson
SP-DP Unit Shipped x Unit Cost = Cost
1B 100 X 2 = 200.00
2A 20 X 10 = 200.00
2C 100 X 9 = 900.00
3A 80 x 7 = 560.00
1C 0x6 = 0.00
Total Transportation Cost: 1,860.00

11/11/2024 60
Lesson
TABLE 3
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 8 1B 2 1C 6 Computation for Improvement Indices
1 100 1A : +8 – 10 + 9 – 6 = 1
100 0
2B: +9 – 2 + 6 – 9 = 4
2A 10 2B 9 2C 9
2 120 3B: +10 – 2 + 6 – 9 + 10 – 7 = 8
20 100 3C: +7 – 9 + 10 – 7 = 1
3A 7 3B 10 3C 7
3 80 Optimal Solution is
80
achieved.
DEMAND 100 100 100 300

11/11/2024 61
Lesson
OPTIMAL SOULTION:
SP-DP No. of Shipping Cost per Transportation
Loads unit Cost
SP1 – DP B 100 units 2 200.00
SP2 – DP A 20 units 10 200.00
SP2 – DP C 100 units 9 900.00
SP3 – DP A 80 units 7 560.00
TOTAL TRANSPORTATION COST: 1,860.00

11/11/2024 62
Lesson
UNBALANCED PROBLEM
 it occurs when Total demand  Total supply
Circumstances Treatments
Total Demand < Total Supply Add dummy (fake) destination point and the shipping cost per unit
is zero.
Total Demand > Total Supply Add dummy (fake) shipping point and the shipping cost per unit is
zero.

 In either case, shipping cost coefficients of zero are assigned to each dummy location because no
shipments are actually made from a dummy shipping point to dummy destination point.

11/11/2024 63
Lesson
TABLE 1

SHIPPING DESTINATION POINTS Total Demand > Total Supply

SUPPLY
POINTS A B C Add dummy (fake) shipping point
1A 6 1B 4 1C 9 and the shipping cost per unit is zero.
1 200

2A 10 2B 5 2C 8
2 175

3A 12 3B 7 3C 6
3 75

450
DEMAND 250 100 150
500

11/11/2024 64
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C
1A 6 1B 4 1C 9
1 200

2A 10 2B 5 2C 8
2 175

3A 12 3B 7 3C 6
3 75

DA 0 DB 0 DC 0 450
Dummy
DEMAND 250 100 150 50
500

500

11/11/2024 65
Lesson
TABLE 1

SHIPPING DESTINATION POINTS

SUPPLY
POINTS A B C
1A 6 1B 4 1C 9
1 200
200
Total Transportation Cost = 2,850.00
2A 10 2B 5 2C 8
2 175 Improvement Indices
50 100 25 3A: +12 – 10 + 8 – 6 = 4
3A 12 3B 7 3C 6 1B: +4 – 5 + 10 – 6 = 3
3 75 1C: +9 – 8 + 10 – 6 = 5
75
3B: +7 – 5 + 8 – 6 = 4
DA 0 DB 0 DC 0
Dummy 50 DA: 0 – 10 + 8 – 0 = -2
50 DB: 0 – 5 + 8 – 0 = 3

DEMAND 250 100 150 500

11/11/2024 66
Lesson
TABLE 2
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C New Loads

1
1A 6 1B 4 1C 9
200
DA 0 + 50 = 50
200
A2 50 – 50 = 0
2A 10 2B 5 2C 8
2
50 100 25
175 2C 25 + 50 = 75
3A 12 3B 7 3C 6 DC 50 – 50 = 0
3 75
75

DA 0 DB 0 DC 0
Dummy 50
50

DEMAND 250 100 150 500

11/11/2024 67
Lesson
TABLE 2
SHIPPING DESTINATION POINTS New Loads
SUPPLY DA 0 + 50 = 50
POINTS A B C
1A 6 1B 4 1C 9 A2 50 – 50 = 0
1 200
200 0
2C 25 + 50 = 75
2A 10 2B 5 2C 8
2 175 DC 50 – 50 = 0
100 75

3A 12 3B 7 3C 6
3 75 Checking for Degeneracy
75
5 < (4+3) – 1
DA 0 DB 0 DC 0 5<6
Dummy 50
50
Degeneracy exist.
DEMAND 250 100 150 500

11/11/2024 68
Lesson
TABLE 2
SHIPPING DESTINATION POINTS Total Transportation Cost = 2,750.00
SUPPLY
POINTS A B C Improvement Indices
1A 6 1B 4 1C 9 2A: +10 – 6 + 4 – 5 = 3
1 200 3A: +12 – 6 + 4 – 5 + 8 – 6 = 7
200 0
3B: +7 – 5 + 8 – 6 = 4
2A 10 2B 5 2C 8 1C: +9 – 8 + 5 – 4 = 2
2 175
100 75 DB: 0 – 4 + 6 – 0 = 2
DC: 0 – 8 + 5 – 4 + 6 – 0 = -1
3A 12 3B 7 3C 6
3 75
75

DA 0 DB 0 DC 0
Dummy 50
50

DEMAND 250 100 150 500

11/11/2024 69
Lesson
TABLE 2
SHIPPING DESTINATION POINTS New Loads
SUPPLY
POINTS A B C DC 0+0=0
1A 6 1B 4 1C 9 2C 75 – 0 = 75
1 200
200 0
2B 100 + 0 = 100
2A 10 2B 5 2C 8
2
100 75
175 1B 0–0=0
3A 12 3B 7 3C 6 1A 200 – 0 = 200
3 75
75 DA 50 – 0 = 50
DA 0 DB 0 DC 0
Dummy 50
50

DEMAND 250 100 150 500

11/11/2024 70
Lesson
TABLE 2
Improvement Indices
SHIPPING DESTINATION POINTS
SUPPLY
POINTS A B C 2A + 10 – 6 + 4 – 5 = 3
1A 6 1B 4 1C 9 3A +12 – 6 + 4 – 5 + 8 – 6 = 7
1 200
200 0
3B +7–5+8–6=4
2A 10 2B 5 2C 8 1C +9–8+5–4=2
2 175
100 75
DB 0–4+6–0=2
3A 12 3B 7 3C 6
3 75 DC 0 – 8 + 5 – 4 + 6 – 0 = -1
75

DA 0 DB 0 DC 0 DC can no longer be improved

Dummy 50 because the zero stone in 1B is
50
considered to be the lowest stone in a
negative position. Zero stone is
DEMAND 250 100 150 500 considered to be a load.

11/11/2024 71
Lesson
TABLE 2
SHIPPING DESTINATION POINTS OPTIMAL SOULTION:
SUPPLY SP1 – DB A : 200 Units
POINTS A B C
SP2 – DP B: 100 Units
1A 6 1B 4 1C 9 SP2 – DB C: 75 Units
1 200
200 0 SP3 – DB C: 75 Units
Total Transportation cost: 2,750.00
2A 10 2B 5 2C 8
2 175
100 75

3A 12 3B 7 3C 6
3 75
75

DA 0 DB 0 DC 0
Dummy 50
50

DEMAND 250 100 150 500

11/11/2024 72
Lesson
MULTIPLE OPTIMAL SOLUTION
 It is indicated when one or more of the improvement indices in the optimal solution stage are equal
to zero.

 to deal with this, follow the steps in finding the new load of the closed path of the cell that obtained
a zero index.

 The number of zeros in the improvement indices indicate the number of alternative solutions.

 It provides management with greater flexibility in selecting and using resources.

11/11/2024 73
Lesson
TABLE 1
DESTINATION POINTS Total Transportation Cost: 3,200.00
SHIPPING
SUPPLY
POINTS A B C Improvement Indices:
2A: +8 – 5 + 4 – 4 = 3
1A 5 1B 4 1C 3
1 300 3A: +9 – 5 + 4 – 4 + 3 – 5 = 2
200 100 3B: +7 – 4 + 3 – 5 = 1
2A 8 2B 4 2C 3 1C: +3 – 3 + 4 – 4 = 0
2 150
100 50
3A 9 3B 7 3C 5 Since all of the improvement indices
3 250
250 are zero and positive then an optimal
solution is achieved.
DEMAND 200 200 300 700

11/11/2024 74
Lesson
SP-DP Loads
SP1 – DP A 200 units
SP1 – DP B 100 units
SP2 – DP B 100 units
SP2 – DP C 50 units
SP3 – DP C 250 units
OPTIMAL SOLUTION
Total Transportation Cost 3,200.00

11/11/2024 75
Lesson
TABLE 1
SHIPPING DESTINATION POINTS Total Transportation Cost: 3,200.00
SUPPLY
POINTS A B C Improvement Indices:
1A 5 1B 4 1C 3 2A: +8 – 5 + 4 – 4 = 3
1 300 3A: +9 – 5 + 4 – 4 + 3 – 5 = 2
200 100
3B: +7 – 4 + 3 – 5 = 1
2A 8 2B 4 2C 3
2 150 1C: +3 – 3 + 4 – 4 = 0
100 50
Notice that 1C obtained a zero index
3A 9 3B 7 3C 5
3 250 which means that there is an
250 alternate solution

DEMAND 200 200 300 700 To find the alternate solution, follow
the steps in finding the new load for
the cells involved in the close path of
1C.

11/11/2024 76
Lesson
TABLE 1
SHIPPING DESTINATION POINTS
SUPPLY
New Loads
POINTS A B C 1C 0 + 50 50
1A 5 1B 4 1C 3
1 300 2C 50 – 50 0
200 100 (-) (+)
2B 100 + 50 150
2A 8 2B 4 2C 3
2 150 1B 100 – 50 50
100 (+) 50 (-)
3A 9 3B 7 3C 5
3 250
250

DEMAND 200 200 300 700

11/11/2024 77
Lesson
TABLE 1 (ALTERNATE SOLUTION)
SHIPPING DESTINATION POINTS New Loads
SUPPLY 1C 0 + 50 50
POINTS A B C
1A 5 1B 4 1C 3 2C 50 – 50 0
1 300 2B 100 + 50 150
200 50 50
2A 8 2B 4 2C 3 1B 100 – 50 50
2 150
150
Total Transportation Cost: 3,200.00
3A 9 3B 7 3C 5
3 250 1A 200 X 5 1,000.00
250
1B 50 X 4 200.00
DEMAND 200 200 300 700 1C 50 X 3 150.00
2B 150 X 4 600.00
3C 250 X 5 1,250.00

11/11/2024 78
B. Assignment Method
Lesson
ASSIGNMENT METHOD:
The Hungarian Method (Flood’s Techniques)
 It provides an efficient means of finding the optimal solution without making a direct comparison
of every option.

 Operates on a principle of matrix reduction by subtracting and adding appropriate numbers in the
cost table or matrix. The problem can be reduced to a matrix opportunity cost.

 Opportunity costs show relative penalties associated with assigning any person to a project/task.

 Minimization and Maximization

11/11/2024 80
Assignment method
Minimization
Lesson
STEPS IN THE MINIMIZATION ASSIGNMENT METHOD
Assignment Minimization: Set up cost table for the problem

Step 2:
Step 1: Test the cost table to see if optimal assignments are
Find the opportunity cost. possible by drawing the minimum possible lines on
1) Subtract the smallest number in each row from every columns and/or rows such that all zeros are
number in that row including the number itself covered.
2) Subtract the smallest number in each column from every
number in that column including the number itself.

(No of lines = No of R/C)

Not Optimal
(No. of lines < No of Row or
Column)
Optimal solution at zero locations. Systematically make final Step 3:
assignments. Revise opportunity cost table in two steps:
1) Check each row and column for a unique zero, and make

Optimal
a) Subtract the smallest number not covered by a
the first assignment at that intersection. line from itself and every other uncovered
2) Eliminate that row and column and search for another number.
unique zero. Make that assignment and proceed in a like b) Add this smallest number at every intersection
manner. of any two line.

11/11/2024 82
PROBLEM 1 (No of Rows = No of Columns)
Table 1 Table 2
Projects Projects Projects
(Row) (Col)
Person A B C Person A B C Person A B C

Adams 11 14 6 Adams 5 8 0 Adams 5 6 0

Brown 8 10 11 Brown 0 2 3 Brown 0 0 3

Cooper 9 12 7 Cooper 2 5 0 Cooper 2 3 0

Test: 2 lines < no. of R/C

Table 3 Projects Table 3 Projects Optimal Solution:

Assignments Cost
Person A B C Person A B C
Adams to Proj C 6
Adams 3 4 0 Adams 3 4 0 Brown to Proj B 10
Brown 0 0 5 Brown 0 0 5 Cooper to Proj A 9
Total Cost 25
Cooper 0 1 0 Cooper 0 1 0
Test: 3 lines = no. of R/C
Assignment method
Maximization
Lesson
Assignment Maximization: Step 1: Find the Opportunity Cost
Set up cost table for the problem 1) Locate the largest number in the initial
table.
Step 2: 2) Subtract all the numbers from the highest
Find the R/C opportunity costs value, including the number itself.

Step 3: Optimal
Test for minimum possible lines (No of lines = No of R/C) Optimal solution at zero
on columns and/or rows such locations. Systematically
that all zeros are covered. make final assignments.

Not Optimal
(No. of lines < No of R/C)
Step 4:
Revise opportunity cost table line.

11/11/2024 85
Lesson
PROBLEM
Sectors
Ships A B C D
1 20 60 50 55
2 60 30 80 75
3 80 100 90 80 Table 1 (Opportunity Cost Table)
4 65 80 75 70 Sectors
Ships A B C D
1 80 40 50 45
2 40 70 20 25
3 20 0 10 20
4 35 20 25 30

11/11/2024 86
Lesson
Table 1 (Opportunity Cost Table)
Sectors
Ships A B C D
1 80 40 50 45
2 40 70 20 25
3 20 0 10 20 Table 2 (Row)
4 35 20 25 30 Sectors
Ships A B C D
1 40 0 10 5
2 20 50 0 5
3 20 0 10 20
4 15 0 5 10

11/11/2024 87
Lesson
Table 2 (Row)
Sectors
Ships A B C D
1 40 0 10 5
2 20 50 0 5 Table 3 (Column)
3 20 0 10 20 Sectors
4 15 0 5 10 Ships A B C D
1 25 0 10 0
2 5 50 0 0
3 5 0 10 15
4 0 0 5 5
# lines = # R or C = 4 = 4
Optimal Solution is achieved.

11/11/2024 88
Lesson
Table 3 (Optimal Table) Cost Table
Sectors Sectors
Ships A B C D Ships A B C D
1 25 0 10 0 1 20 60 50 55
2 5 50 0 0 2 50 30 80 75
3 5 0 10 15 3 80 100 90 80
4 0 0 5 5 4 65 80 75 70
Optimal Solution:
Assign. Efficiency
1–D 55
2–C 80
3–B 100
4–A 65
Total Eff. 300
11/11/2024 89
Assignment method
Special Cases
Lesson
Unbalanced Assignment Problem
 It occurs when No. of Rows  No. of Columns

Circumstances Treatment
No. of Rows > No. of Columns Add a dummy column and the cost or estimates must be equal to
zero.
No. of Rows < No. of Columns Add a dummy row and the cost or estimates must be equal to
zero.

 The adding of dummies will balance the dimension of the table and allow to solve the problem.

 Since the dummies are really non-existent, it is reasonable to enter zeros as the costs or estimates.

11/11/2024 91
Lesson
Assignments
Hirees Ohama Miami Dallas New York
Jones 800 1100 1200 1000
Table 1 (Row)
Smith 500 1600 1300 800
Assignments
Wilson 500 1000 2300 1500
Hirees Ohama Miami Dallas New York
Dummy 0 0 0 0
Jones 0 300 400 200
Rows < Columns
Smith 0 1100 800 300
Add a dummy row
Wilson 0 500 1800 1000
Dummy 0 0 0 0

11/11/2024 92
Lesson
Table 1 (Row)
Assignments
Hirees Ohama Miami Dallas New York
Jones 0 300 400 200
Smith 0 1100 800 300 Table 2 (Column)
Wilson 0 500 1800 1000 Assignments
Dummy 0 0 0 0 Hirees Ohama Miami Dallas New York
Jones 0 300 400 200
Smith 0 1100 800 300
Wilson 0 500 1800 1000
Dummy 0 0 0 0
Test: No line < No R or C = 2 < 4

11/11/2024 93
Lesson
Table 2 (Column)
Assignments
Hirees Ohama Miami Dallas New York
Jones 0 300 400 200
Smith 0 1100 800 300 Table 3 (Improvement)
Wilson 0 500 1800 1000 Assignments
Dummy 0 0 0 0 Hirees Ohama Miami Dallas New York
Jones 0 100 200 0
Smith 0 900 600 100
Wilson 0 300 1600 800
Dummy 200 0 0 0
Test: No lines < No R or C = 3 < 4

11/11/2024 94
Lesson
Table 3 (Improvement)
Assignments
Hirees Ohama Miami Dallas New York
Jones 0 100 200 0
Smith 0 900 600 100
Table 4 (Improvement)
Wilson 0 300 1600 800
Assignments
Dummy 200 0 0 0
Hirees Ohama Miami Dallas New York
Jones 0 0 100 0
Smith 0 800 500 100
Wilson 0 200 1500 800
Dummy 300 0 0 100
Test: No lines < No R or C = 3 < 4

11/11/2024 95
Lesson
Table 4 (Improvement)
Assignments
Hirees Ohama Miami Dallas New York
Jones 0 0 100 0
Smith 0 800 500 100
Table 5 (Improvement)
Wilson 0 200 1500 800
Assignments
Dummy 300 0 0 100
Hirees Ohama Miami Dallas New York
Jones 100 0 100 0
Smith 0 700 400 0
Wilson 0 100 1400 700
Dummy 400 0 0 100
Test: No Lines = No R or C = Optimal Solution is achieved

11/11/2024 96
Lesson
Table 5 (Improvement) Cost Table
Assignments Assignments
Hirees Ohama Miami Dallas New York Hirees Ohama Miami Dallas New York
Jones 100 0 100 0 Jones 800 1100 1200 1000
Smith 0 700 400 0 Smith 500 1600 1300 800
Wilson 0 100 1400 700 Wilson 500 1000 2300 1500
Dummy 400 0 0 100 Dummy 0 0 0 0
Optimal Solution: Assignments Cost
Jones-Miami 1,100
Smith –New York 800
Wilson-Ohama 500
Total Cost 2,410

11/11/2024 97
Lesson
Multiple Optimal Solution
 This appears when there is no unique zero in the rows and columns in the last table.

11/11/2024 98
 Lesson
PROBLEM
Assignments
Person A B C D
1 7 6 20 13
2 10 14 17 19
Table 1 (Row)
3 5 9 20 14
4 10 12 14 16 Assignments
Person A B C D
1 1 0 14 7
2 0 4 7 9
3 0 4 15 9
4 0 2 4 6

11/11/2024 99
Lesson
Table 1 (Row)

Assignments
Person A B C D
1 1 0 14 7
Table 2 (Column)
2 0 4 7 9
3 0 4 15 9 Assignments
4 0 2 4 6 Person A B C D
1 1 0 10 1
2 0 4 3 3
3 0 4 11 3
4 0 2 0 0
Test: # lines < # R or C = 3 < 4

11/11/2024 100
Lesson
Table 2 (Column)

Assignments
Person A B C D
1 1 0 10 1 Table 3 (Improvement)
2 0 4 3 3 Assignments
3 0 4 11 3 Person A B C D
4 0 2 0 0 1 4 0 10 1
2 0 1 0 0
3 0 1 8 0
4 3 2 0 0
Test: # lines = # R or C = 4 = 4
Optimal Solution is achieved.

11/11/2024 101
Lesson
Table 3 (Optimal Solution)
Cost Table
Assignments Assignments
Person A B C D Person A B C D
1 4 0 10 1 1 7 6 20 13
2 0 1 0 0 2 10 14 17 19
3 0 1 8 0 3 5 9 20 14
4 3 2 0 0 4 10 12 14 16

Assignments Cost
1–B 6
2–A 10
4–C 14
3–D 14
Total Cost 44

11/11/2024 102
Lesson
Table 3 (Alternate Solution 1)
Cost Table
Assignments Assignments
Person A B C D Person A B C D
1 4 0 10 1 1 7 6 20 13
2 0 1 0 0 2 10 14 17 19
3 0 1 8 0 3 5 9 20 14
4 3 2 0 0 4 10 12 14 16

Assignments Cost
1–B 6
2–C 17
3–A 5
4-D 16
Total Cost 44

11/11/2024 103
Lesson
Table 3 (Alternate Solution 2)
Cost Table
Assignments Assignments
Person A B C D Person A B C D
1 4 0 10 1 1 7 6 20 13
2 0 1 0 0 2 10 14 17 19
3 0 1 8 0 3 5 9 20 14
4 3 2 0 0 4 10 12 14 16

Assignments Cost
1–B 6
2–D 19
3–A 5
4-C 14
Total Cost 44

11/11/2024 104
References
Anderson, D. R., Sweeney, D. J., Williams, T. A., Camm, J. D., Cochran, J. J., Fry, M. J., & Ohlmann, J. W.
(2016). An Introduction to Management Science: Quantitative Approaches to Decision Making
(14th ed.). Boston, USA: Cengage Learning. Retrieved August 2017, from
http://dreamsupport.us/justin/Books%20&%20Textbooks/Business/Introduction%20to
%20Management%20Science%2014e%20-%20David%20Anderson.pdf
Render, Barry, Stair, Ralph M., and Hanna, Michael E. (2011). Quantitative Analysis for Management.
11th edition. Prentice Hall. Retrieved at https://www.pdfdrive.com/quantitative-analysis-for-
management-2-downloads-d39562234.html
Render, Barry and Stair, Ralph, Jr. M. 1997. Quantitative Analysis for Management. 6 th edition. USA:
Prentice-Hall International, Inc.
Taylor, W. (2013). Introduction to Management Science (11th ed.). New Jersey: Pearson Education, Inc.

11/11/2024 105
Get in Touch
With Me

[email protected]
[email protected]

City of Batac, Ilocos Norte, Philippines

09984297121
09667258287