Advances in Nonlinear Network Models and Algorithms

  • John M. Mulvey
Conference paper
Part of the NATO ASI Series book series (volume 51)


Network models with nonlinear objectives occur in numerous economic, engineering and management applications. These areas are described, along with highly specialized nonlinear programming algorithms for solving the resulting large-scale problems. It is shown that nonlinear network models can be handled efficiently using serial or vector processing computers. Extensions to stochastic programs are discussed.


Stochastic Program Social Account Matrix Federal Aviation Administration Simplicial Decomposition Nonlinear Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Abadie, “The GRG Method For Nonlinear Programming,” in Design and Implementation of Optimization Software, ed. H.J. Greenberg, pp. 335–362, Sijthoff & Noordhoff, Netherlands, 1978.Google Scholar
  2. 2.
    P. G. Abrahamson, “A Nested Decomposition Approach for Solving Staircase Linear Programs,” Report SOL 83-4, Department of Operations Research, Stanford University, 1983.Google Scholar
  3. 3.
    D. P. Ahlfeld, R. S. Dembo, J. M. Mulvey, and S. A. Zenios, “Nonlinear Programming on Generalized Networks,” Report EES-85-7, to appear in Transactions on Mathematical Software, Princeton University, June 1985.Google Scholar
  4. 4.
    R.S. Barr, The Multinational Cash Management Problem: A Generalized Network Approach, University of Texas, Austin,Texas, 1972.Google Scholar
  5. 5.
    O. Barros and A. Weintraub, “Spatial Market Equilibrium Problems and Network Models,” Discrete Applied Mathematics, vol. 13, pp. 109–130,1986.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    M.C. Biggs and M.A. Laughton, “Optimal Electric Power Scheduling: A Large Nonlinear Programming Test Problem Solved by Recursive Quadratic Programming,” Mathematical Programming, vol. 13, pp. 167–182,1977.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    J. R. Birge, “Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs, ” Operations Research, vol. 33, no. 5, pp. 989–1007,1985.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    J. Bisschop and A. Meeraus, “Matrix Augmentation and Partitioning in the Updating of the Basis Inverse,” Mathematical Programming, vol. 13, pp. 241–254,1977.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    J. Bisschop and A. Meeraus, “On the Development of a General Algebraic Modeling System in a Strategic Planning Environment,” Mathematical Programming Study, vol. 20, pp. 1–29,1982.CrossRefGoogle Scholar
  10. 10.
    G. G. Brown and R. D. McBride, “Solving Generalized Networks,” Management Science, vol. 30, no. 12, Dec. 1984.Google Scholar
  11. 11.
    L. Cooper and L.J. LeBlanc, “Stochastic Transportation Problems and Other Network Related Convex Problems,” Naval Research Logistics Quarterly, 1977Google Scholar
  12. 12.
    R. L. Crum and D. L. Nye, “A Network Model of Insurance Company Cash Flow Management, ” Mathematical Programming Study, vol. 15, pp. 86–101,1981.CrossRefGoogle Scholar
  13. 13.
    G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, 1963.MATHGoogle Scholar
  14. 14.
    R. Dembo, A. Chiarri, J. Gomez, L. Paradinas, and J. Guerra, “Integrated System for Electric Power System Operation Planning,” Hidroelectrica Espanola Technical Report, Madrid, 1985.Google Scholar
  15. 15.
    M. Florian, “Nonlinear Cost Network Models in Transportation Analysis,” Mathematical Programming Study, vol. 26, pp. 167–196,1986.MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    R. H. Fourer, “Solving Staircase Linear Programs by the Simplex Method, 1: Inversion,” Mathematical Programming, vol. 23, pp. 274–313,1982.MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    R. H. Fourer, “Solving Staircase Linear Programs by the Simplex Method, 2: Pricing,” Mathematical Programming, vol. 25, pp. 251–292,1983.MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    R. Glassey, “Nested Decomposition and Multi-Stage Linear Programs,” Management Science, vol. 20, no. 3, pp. 282–292,1973.MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    F. Glover, J. Hultz, D. Klingman, and J. Stutz, “Generalized Networks: A Fundamental Computer-Based Planning Tool,” Management Science, vol. 24, no. 12, pp. 1209–1220,1978.CrossRefGoogle Scholar
  20. 20.
    M.A. Hanscom, L. Lafond, L.S. Lasdon, and G. Pronovost, “Modeling and Resolution of the Deterministic Mid-term Energy Production Problem for the Hydro-Quebec System,” Report IREQ-1453, L’ Institut de Recherches de 1’ Hydro-Quebec, 1976.Google Scholar
  21. 21.
    H.H. Happ, “Optimal Power Dispatch-A Comprehensive Study,” IEEE Transactions PAS, vol. 96, pp. 841–854,1977.Google Scholar
  22. 22.
    P.T. Harker, “Alternative Models of Spatial Competition,” Operations Research, vol. 34, No.3, pp. 410–436, May 1986.MATHCrossRefGoogle Scholar
  23. 23.
    D. W. Heam, S. Lawphongpanich, and J. A. Ventura,, “Restricted Simplicial Decomposition: Computation and Extensions,” Research Report No. 84-38, (to appear Mathematical Programming Study), University of Florida, Gainesville, Oct 1984.Google Scholar
  24. 24.
    J. K. Ho and A. S. Manne, “Nested Decomposition for Dynamic Models,” Mathematical Programming, vol. 6, pp. 121–140, North-Holland, 1974.MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    B.F. Hobbs, “Network Models of Spatial Oligopoly with an Application to Deregulation of Electricity Generation,” Operations Research, vol. 34, No.3, pp. 395–409, May 1986.CrossRefGoogle Scholar
  26. 26.
    B. Von Hohenbalken, “A Finite Algorithm to Maximize Certain Pseudoconcave Functions on Polytopes,” Mathematical Programming, vol. 13, pp. 189–206,1975.CrossRefGoogle Scholar
  27. 27.
    B. Von Hohenbalken, “Simplicial Decomposition in Nonlinear Programming Algorithms,” Mathematical Programming, vol. 13, pp. 49–68,1977.MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    C. A. Holloway, “An Extension of the Frank and Wolfe Method of Feasible Directions,” Mathematical Programming, vol. 6, no. 1, pp. 14–27,1974.MATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    H. Markowitz, Portfolio Selection, Wiley, New York, 1959.Google Scholar
  30. 30.
    J. M. Mulvey, S. A. Zenios, and D. P. Ahlfeld, “Simplicial Decomposition for Convex Generalized Networks,” Report EES-85-8, submitted to Mathematical Programming, Princeton University, 1985.Google Scholar
  31. 31.
    J. M. Mulvey and S. A. Zenios, “Real-Time Operational Planning for the U.S. Air-Traffic System, ” Research Report (submitted to Applied Numerical Mathematics ), Princeton University, Princeton, New Jersey, 1986.Google Scholar
  32. 32.
    J. M. Mulvey, “Anticipatory Personnel Management: An Application of Multi-Criteria Networks, ” to appear in Management of R & D Engineering, North-Holland, 1986.Google Scholar
  33. 33.
    J. M. Mulvey, “Nonlinear Network Models in Finance,” Advances in Mathematical Programming and Financial Planning, vol. 1, pp. 253–271, JAI Press, 1987.Google Scholar
  34. 34.
    B. A. Murtagh and M. A. Saunders, “MINOS User’s Guide,” Report SOL 77-9, Department of Operations Research, Stanford University, California, 1977.Google Scholar
  35. 35.
    L. Qi, “Forest Iteration Method for Stochastic Transportation Problem,” Mathematical Programming Study 25, pp. 142–163,1985.Google Scholar
  36. 36.
    R. T. Rockafellar and R. J-B. Wets, “Scenarios and Policy Aggregation in Optimization Under Uncertainty,” WP-87-119, IIASA, December 1987.Google Scholar
  37. 37.
    J. B. Rosen, “Convex Partition Programming,” in Recent Advances in Mathematical Programming, ed. P. Wolfe, McGraw-Hill, New York, 1963.Google Scholar
  38. 38.
    R. E. Rosenthal, “A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System,” Operations Research, vol. 29, pp. 763–786,1981.MATHCrossRefMathSciNetGoogle Scholar
  39. 39.
    A. Rudd and B. Rosenberg, “Realistic Portfolio Optimization,” in TIMS Studies in Management Sciences, vol. 11, pp. 21–46,1979.Google Scholar
  40. 40.
    D. P. Rutenberg, “Maneuvering Liquid Assets in a Multi-National Company: Formulation and Deterministic Solution Procedures,” Management Science, vol. 16, no. 10, pp. B671–B684, 1970.CrossRefGoogle Scholar
  41. 41.
    A.M. Sasson and H.M. Merrill, “Some Applications of Optimization Techniques to Power Systems Problems,” Proceedings IEEE, vol. 62, pp. 959–972,1974.CrossRefGoogle Scholar
  42. 42.
    A.M. Sasson, W. Snyder, and M. Flam, “Comments on “Review of Load-Flow” Calculation Methods,” Proceedings IEEE, vol. 63, pp. 712–713,1975.CrossRefGoogle Scholar
  43. 43.
    D. M. Scott, “A Dynamic Programming Approach to Time-Staged Convex Programs,” Report SOL 85-3, Department of Operations Research, Stanford University, 1985.Google Scholar
  44. 44.
    S. W. Wallace, “A Piecewise Linear Upper Bound on the Network Recourse Function,” CMI No. 862330-3, Department of Science and Technology, Christian Michelsen Institute, Bergen, Norway, February 1985.Google Scholar
  45. 45.
    S. W. Wallace, “Solving Stochastic Programs with Network Recourse,” Networks, vol. 16, pp. 295–317, 1986.MATHCrossRefMathSciNetGoogle Scholar
  46. 46.
    R. J. Wittrock, “Advances in Nested Decomposition Algorithms for Solving Staircase Linear Programs,” Report SOL 83-2, Department of Operations Research, Stanford University, 1983.Google Scholar
  47. 47.
    W. T. Ziemba, “Computational Algorithms for Convex Stochastic Programs with Simple Recourse,” Operations Research, vol. 18, pp. 414–431, 1970.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • John M. Mulvey
    • 1
  1. 1.Department of Civil Engineering and Operations ResearchPrinceton University School of Engineering and Applied SciencePrincetonUSA

Personalised recommendations