Chapter – 4

Prob. # Problem / Model Type

4.1 Transportation model

4.2 Assignment model

4.3 Transportation, transshipment models

4.4 Shortest path model, two different arc lengths

4.5 Traveling salesman model

4.6 Minimal spanning tree model

4.7 Maximal flow model

4.8 Transportation model, model assumptions, constraints on shipments

4.9 Assignment model -- Maximization

4.10 Shortest path models with different objectives

4.11 Minimal spanning tree model

4.12 Assignment model turned into a transportation model

4.13 Transportation model in which supplies and demands must first be determined

4.14 Minimal spanning tree problem

4.15 Maximization assignment models

4.16 Traveling salesman model, using the model to calculate a total profit

4.17 Maximal flow model; objective must be determined

4.18 Shortest path model

4.19 Assignment model solved four ways, alternate optimal solutions

4.20 Assignment model in which one worker can perform more than one activity--solved two ways

4.21 Maximization transportation model, calculation of objective function coefficients

4.22 Shortest path models

4.23 Traveling salesman model

4.24 Shortest path models, traveling used to calculate schedules

4.25 Transportation model for a production model

4.26 Maximal flow model

4.27 Shortest path and cost model

4.28 Traveling salesman model

4.29 Minimal spanning tree model

4.30 Transportation model

4.31 Maximization assignment model

 4.32 Transportation approach to a production model

4.33 Traveling salesman model

4.34 Maximization transportation model, upper bound constraints

4.35 Assignment model, job mark-ups

4.36 Transportation model

4.37 Transportation model, sensitivity analysis, unbalanced supply/demand situations, alternate

optimal solutions

4.38 Transportation models, evaluation of alternatives, addition of constraints

4.39 Assignment model

4.40 Assignment model, lost opportunity matrix, analysis of objective function coefficients

4.41 Minimal spanning tree and shortest path models

4.42 Maximization assignment models, more than one job can be performed by a worker,
maximization transportation models

4.43 Maximal flow model; bidirectional arcs

4.44 Capacitated transshipment model for production

4.45 Minimal spanning tree model

4.46 Traveling salesman model, design of schedules

4.47 Traveling salesman model that requires a specific ordering for one node

4.48 Shortest path models with final “negative” arc lengths subtracted to determine the best policy

4.49 Transportation model, linear programming formulation of the transportation problem

4.50 Transshipment model, calculating break-even point, shortest path model, transportation
model

Case 4.1 Shortest path, minimal spanning tree, traveling salesman models -- when to use each

Case 4.2 Maximal flow model, maximization assignment model, shortest path model, transportation
models, calculation of net profit

Case 4.3 Shortest path, transportation models, evaluation of alternatives