Applications of the operator theory of parametric programming for the transportation and generalized transportation problems

  • V. Balachandran
  • V. Srinivasan
  • G. L. Thompson
Chapter
First Online:
Received:
Revised:
Part of the Mathematical Programming Studies book series (MATHPROGRAMM, volume 15)

Abstract

Many operations research problems can be modelled as the transportation problem (TP) or generalized transportation problem (GTP) of linear programming together with parametric programming of the rim conditions (warehouse availabilities and market requirements) and/or the unit costs (and/or the weight coefficients in the case of the GTP). The authors have developed an operator theory for simultaneously performing such parametric programming calculation. The present paper surveys the application of this methodology to several classes of problems: (a) optimization models involving a TP or GTP plus the consideration of an additional important factor (e.g., production smoothing, cash management); (b) bicriterion TP and GTP (e.g., multimodal TP involving cost/time trade-offs, TP with total cost/bottleneck time trade-offs); (c) multi-period growth models (e.g., capacity expansion problems); (d) extensions of TP and GTP (e.g., stochastic TP and GTP, convex cost TP) (e) branch and bound problems involving the TP or GTP as subproblems (e.g., traveling salesman problem, TP with quantity discounts); and (f) algorithms for solving the TP and GTP (e.g., a polynomially bounded primal basic algorithm for the TP, a weight operator algorithm for the GTP). The managerial and economic significance of the operators is discussed.

Key words

Transporation Networks Parametric Programming Generalized Transportation Problems Operator Theory Network Application 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Abraham, “Uber die Stabilität der Lösungen im Transportproblem der Linearen Programmierung”, Czechoslovak Mathematical Journal 8 (1958) 131–138.MathSciNetGoogle Scholar
  2. [2]
    V. Balachandran, “Optimal production growth for the machine loading problem”, Naval Research Logistics Quarterly 22 (1975) 593–607.CrossRefMathSciNetGoogle Scholar
  3. [3]
    V. Balachandran, “An integer generalized transporation model for optimal job assignment in computer networks”, Operations Research 24 (1976) 742–759.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    V. Balachandran, “The stochastic generalized transportation problem—An operator theoretic approach”, International Journal of Networks 9 (1979) 61–70.MathSciNetGoogle Scholar
  5. [5]
    V. Balachandran and S. Jain, “Optimal facility location under random demand with general cost structure” Naval Research Logistics Quarterly 23 (1976) 421–436.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    V. Balachandran and A. Perry, “Transportation type problems with quantity discounts”, Naval Research Logistics Quarterly 23 (1976) 195–209.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    V. Balachandran and G.L. Thompson, “An operator theory of parametric programming for the generalized transportation problem, I: Basic theory”, Naval Research Logistics Quarterly 22 (1975) 79–100.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    V. Balachandran and G.L. Thompson, “An operator theory of parametric programming for the generalized transportation problem, II: Rim, cost and bound operators”, Naval Research Logistics Quarterly 22 (1975) 101–125.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    V. Balachandran and G.L. Thompson, “An operator theory of parametric programming for the generalized transportation problem, III: Weight operators”, Naval Research Logistics Quarterly 22 (1975) 297–315.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    V. Balachandran and G.L. Thompson, “An operator theory of parametric programming for the generalized transportation problem, IV: Global operators”, Naval Research Logistics Quarterly 22 (1975) 317–339.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    E. Balas and P. Ivanescu (P.L. Hammer), “On the transportation problem, I and II”, Cahiers du Centre de Recherche Operationnelle (Brussels) 4 (1962) 98–116 and 131–160.MathSciNetGoogle Scholar
  12. [12]
    E.H. Bowman, “Production scheduling by the transportation method of linear programming”, Operations Research 4 (1956) 100–103.CrossRefGoogle Scholar
  13. [13]
    G.H. Bradley, G.G. Brown and G.W. Graves, “Design and implementation of large-scale primal transshipment algorithms”, Management Science 24 (1977) 1–34.MATHCrossRefGoogle Scholar
  14. [14]
    L. Caccetta, “The transportation problem with piecewise linear costs”, Working Paper, Department of Mathematics, University of Western Australia (1976).Google Scholar
  15. [15]
    A. Charnes and W.W. Cooper, Management models and industrial applications of linear programming, Vol. 1. Wiley New York, 1961).MATHGoogle Scholar
  16. [16]
    A. Charnes, and M. Kirby, “The dual method and the method of Balas and Ivanescu for the transportation model”, Cahiers du Centre de Recherche Operationnell (Brussels) 6 (1964) 5–18.MATHMathSciNetGoogle Scholar
  17. [17]
    G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).MATHGoogle Scholar
  18. [18]
    G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs”, Operations Research 8 (1960) 101–111.MATHCrossRefGoogle Scholar
  19. [19]
    W.L. Eastman, “Linear programming with pattern constraints”, Unpublished doctoral disseration, Harvard University, Boston (1958).Google Scholar
  20. [20]
    K. Eisemann, “The generalized stepping stone method for the machine loading model”, Management Science 11 (1964) 154–176CrossRefGoogle Scholar
  21. [21]
    C.O. Fong and V. Srinivasan, “Multiperiod capacity expansion and shipment planning with linear costs”, Naval Research Logistics Quarterly 23 (1976) 37–52.MATHCrossRefMathSciNetGoogle Scholar
  22. [22]
    C.O. Fong and V. Srinivasan, “Determining all nondegenerate shadow prices for the transportation problem”, Transportation Science 11 (1977) 199–222.CrossRefGoogle Scholar
  23. [23]
    C.O. Fong and V. Srinivasan, The multi-region dynamic capacity expasion problem, I and II”, Operations Research 29 (1981) to appear.Google Scholar
  24. [24]
    L.R. Ford and D.R. Fulkerson, Flows in networks, (Princeton University Press, Princeton, NJ, 1963).Google Scholar
  25. [25]
    R.S. Garfinkel and M.R. Rao, “The bottleneck transportation problem”, Naval Research Logistics, Quarterly 18 (1971) 465–472.CrossRefMathSciNetGoogle Scholar
  26. [26]
    S.J. Garstka, “Computation in stochatic programs with recourse”, unpublished doctoral thesis, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1970).Google Scholar
  27. [27]
    S.I. Gass and T. Saaty, “The computational algorithm, for the parametric objective function”, Naval Research Logistics Quarterly 2 (1955) 39–45.CrossRefMathSciNetGoogle Scholar
  28. [28]
    S.I. Gass and T. Saaty, “Parametric objective function, Part II: Generalization”, Operations Research 3 (1955) 395–401.CrossRefMathSciNetGoogle Scholar
  29. [29]
    L. Gelders and P.R. Kleindorer, “Coordinating aggregate and detailed scheduling decisions in the one-machine job shop, Part 1: Theory”, Operations Research 22 (1974) 46–60.MATHCrossRefMathSciNetGoogle Scholar
  30. [30]
    D.H. Gensch and E.A. Kervinen, “The traveling salesman’s subtour problem”, Working Paper, School of Business Administration, University of Wisconsin, Milwaukee, WI (1975).Google Scholar
  31. [31]
    F. Glover, D. Karney, D. Klingman and A. Napier, “A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems”, Management Science 20 (1974) 793–813.MATHCrossRefMathSciNetGoogle Scholar
  32. [32]
    F. Glover and D. Klingmen, “New advances in the solution of large scale network and network related problems”, Research Report CS-177, Center for Cybernetic Studies, The University of Texas at Austin (1974).Google Scholar
  33. [33]
    W. Grabowski and W. Szwarc, “Optimum transportation bases”, Zastosowania Matematyki (Warsaw) 9 (1968) 357–389.MATHGoogle Scholar
  34. [34]
    P.L. Hammer, “Time-minimizing transportation problems”, Naval Research Logistics Quarterly 16 (1969) 345–357.MATHMathSciNetGoogle Scholar
  35. [35]
    M. Held and R.M. Karp, “The traveling salesman problem and minimum spanning trees, Part II”, Mathematical Programming 1 (1971) 6–25.MATHCrossRefMathSciNetGoogle Scholar
  36. [36]
    C. Holt, F. Modigliani, J. Muth and H. Simon, Planning production, inventories and workforce Prentice-Hall, Englewood cliffs, NJ, 1960).Google Scholar
  37. [37]
    J.M. Mulvey, “Network relaxations for 0–1 integer programs”, Paper No. WA 3.4, presented at the Joint National Meeting of the Operations Research Society of America, and The Institute of Management Sciences, Las Vegas, NV, 1975.Google Scholar
  38. [38]
    A. Perry, “An optimum seeking algorithm for locating lock boxes”, Midwest AIDS Proceedings (1975).Google Scholar
  39. [39]
    R.C. Rao and D.P. Rutenberg, “Multilocation plant and timing”, Management Science 23 (1977) 1187–1198.MATHCrossRefGoogle Scholar
  40. [40]
    D.M. Shapiro, “Algorithms for the solution of the optimal cost and bottleneck traveling salesman problems”, unpublished doctoral thesis, Washington University, St. Louis, MO (1966).Google Scholar
  41. [41]
    M. Simmonard, Linear programming (Prentice-Hall, Englewood Cliffs, NJ, 1966).Google Scholar
  42. [42]
    T.H.C. Smith, V. Srinivasan and G.L. Thompson, “Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman, problems”, Annals of Discrete Mathematics 1 (1977) 495–506.CrossRefGoogle Scholar
  43. [43]
    V. Srinivasan, “A transshipment model for cash management decisions” Management Science 20 (1974) 1350–1363.CrossRefGoogle Scholar
  44. [44]
    V. Srinivasan and G.L. Thompson, “An operator theory of parametric programming for the transportation problem, I”, Naval Research Logistics Quarterly 19 (1972) 205–225.CrossRefMathSciNetGoogle Scholar
  45. [45]
    V. Srinivasan and G.L. Thompson, “An operator theory of parametric programming for the transportation problem, II”, Naval Research Logistics Quarterly 19 (1972) 227–252.CrossRefGoogle Scholar
  46. [46]
    V. Srinivasan and G.L. Thompson, “Determining optimal growth paths in logistics operations”, Naval Research Logistics Quarterly 19 (1972) 575–599.MATHCrossRefMathSciNetGoogle Scholar
  47. [47]
    V. Srinivasan and G.L. Thompson, “An algorithm for assigning uses to sources in a special class of transportation problems”, Operations Research 21 (1973) 284–295.MATHCrossRefMathSciNetGoogle Scholar
  48. [48]
    V. Srinivasan and G.L. Thompson, “Benefit-cost, analysis of coding, techniques for the primal transportation algorithm”, Journal of the Association for Computing Machinery 20 (1973) 194–213.MATHMathSciNetGoogle Scholar
  49. [49]
    V. Srinivasan and G.L. Thompson, “Solving scheduling problems by applying cost operators to assignment models”, in: S.E. Elmaghraby, ed., Symposium on the theory of scheduling and its applications (Springer, Berlin, 1973) pp. 399–425.Google Scholar
  50. [50]
    V. Srinivasan and G.L. Thompson, “Algorithms for minimizing total cost, bottleneck time, and bottleneck shipment in transportation problems”, Naval Research Logistics Quarterly 23 (1976) 567–595.MATHCrossRefMathSciNetGoogle Scholar
  51. [51]
    V. Srinivasan and G.L. Thompson, “Determining cost vs. time Pareto-optimal frontiers in multi-modal transportation problems”, Transportation Science 11 (1977) 1–19.CrossRefGoogle Scholar
  52. [52]
    V. Srinivasan and G.L. Thompson, “Cost operator algorithms for the transportation problem”, Mathematical Programming 12 (1977) 372–391.MATHCrossRefMathSciNetGoogle Scholar
  53. [53]
    W. Szwarc, “The stability of the transportation problem”, Mathematica 4 (1962): 397–400.MathSciNetGoogle Scholar
  54. [54]
    W. Szwarc, “The time transportation problem”, Zastosowania Matematyki 8 (1966) 231–242.Google Scholar
  55. [55]
    G.L. Thompson, “Recent theoretical and computational, results for transportation and related problems”, in: W.H. Marlow, ed., Modern trends in logistic research (MIT Press, 1976).Google Scholar
  56. [56]
    A.F. Veinott, Jr, “Lattice programming”, Working Paper, Department of Operations Research, Stanford University, Stanford, CA (1977).Google Scholar
  57. [57]
    H. M. Wagner, Principles of operations research with applications to managerial decisions (Prentice-Hall, Englewood Cliffs, NJ, 1975).Google Scholar
  58. [58]
    M. Zeleney, Linear multiobjective programming, (Springer, Berlin, 1974).Google Scholar

Additional Applications of Operator, Theory (Added in Proof)

  1. [59]
    R.V. Nagelhout and G.L. Thompson, “A single source transportation algorithm”, Computer and Operations Research 7 (1980), 185–198.CrossRefGoogle Scholar
  2. [60]
    R.V. Nagelhout and G.L. Thompson, “A cost operator approach to multistage location-allocation”, European Journal of Operations Research, 6(2) (1981) 149–161.MATHCrossRefMathSciNetGoogle Scholar
  3. [61]
    R.V. Nagelhout and G.L. Thompson, “A study of the bottleneck single source transportation problem” Management Sciences Research Report 456, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1980).Google Scholar

Copyright information

© The Mathematical Programming Society 1981

Authors and Affiliations

  • V. Balachandran
    • 1
  • V. Srinivasan
    • 2
  • G. L. Thompson
    • 3
  1. 1.Graduate School of ManagementNorthwestern UniversityEvanstonUSA
  2. 2.Graduate School of BusinessStanford UniversityStanfordUSA
  3. 3.Graduate School of Industrial AdministrationCarnegie-Mellon UniversityPittsburghUSA

Personalised recommendations