Advertisement

A Dual Conjugate Gradient Method for the Single-Commodity Spatial Price Equilibrium Problem

  • Jong-Shi Pang
  • Yuh-Yang Lin
Conference paper
  • 45 Downloads
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 249)

Abstract

This paper describes a new method for solving the single commodity spatial price equilibrium problem. The method is based on conjugate gradient method applied to maximize the dual function of the problem. Covergence of the method is established and computational results are reported.

Keywords

Equilibrium Problem Conjugate Gradient Method Demand Node Dual Program Inverse Demand Function 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avriel, M. 1976. Nonlinear Programming: Analysis and Methods, Prentice-Hall Inc., New Jersey.Google Scholar
  2. Bazaraa, M.S. and C.M. Shetty. 1979. Nonlinear Programming: Theory and Algorithms, John Wiley & Sons, New York.Google Scholar
  3. Bertsekas, D.P. 1982. Projected Newton Methods for Optimization Problems With Simple Constraints, SIAM J. Control and Optimization 20, 221–246.CrossRefGoogle Scholar
  4. Brucker, P. 1984. An 0(n) Algorithm for Quadratic Knapsack Problems, Operations Research Letters 3, 163–166.CrossRefGoogle Scholar
  5. Chao, G.S. and T.L. Friesz. 1984. Spatial Price Equilibrium Sensitivity Analysis, to appear in Transportation Research B.Google Scholar
  6. Cottle, R.W. and R.S. Duvall. 1983. A Lagrangean Relaxation Algorithm for the Constrained Matrix Problems, Technical Report SOL82-10, Systems Optimization Laboratory, Department of Operations Research, Stanford University.Google Scholar
  7. Dembo, R.S. 1983. A Primal Truncated Newton Algorithm With Applications to Large-Scale Nonlinear Network Optimization, Working Paper Series B #72, School of Organization and Management, Yale University.Google Scholar
  8. Dembo, R.S. and J.G. Klincewicz. 1981. A Scaled Reduced Gradient Algorithm for Network Flow Problems With Convex Separable Costs, Mathematical Programming Studies 15, 125–147.CrossRefGoogle Scholar
  9. Ekeland, I. and R. Teman. 1976. Convex Analysis and Variational Problems, North-Holland Publishing Co., Amsterdam.Google Scholar
  10. Ferland, J.A., B. Lemaire and P. Robert. 1978. Analytic Solutions for Nonlinear Programs With One or Two Equality Constraints, Publication #285, Departement d’Informatique et de Recherche Operationelle, Universite de Montreal.Google Scholar
  11. Florian, M. and M. Los. 1982. A New Look at Static Spatial Price Equilibrium Models, Regional Science and Urban Economics 12, 579–597.CrossRefGoogle Scholar
  12. Friesz, T.L., R.L. Tobin, T. Smith and P.T. Harker. 1983. A Nonlinear Complementarity Formulation and Solution Procedure for the General Derived Demand Network Equilibrium Problem, Journal of Regional Science 23, 337–359.CrossRefGoogle Scholar
  13. Helgason, R., J.L. Kennington and H. Lall. 1980. A Polynomially Bounded Algorithm for a Singly Constrained Quadratic Program, Mathematical Programming 18, 338–343.CrossRefGoogle Scholar
  14. Jones, P.C., R. Saigal and M.H. Schneider. 1983a. Computing Nonlinear Network Equilibria, to appear in Mathematical Programming.Google Scholar
  15. Jones, P.C., R. Saigal and M.H. Schneider. 1983b. A Network Variable Dimension Homotopy for Computing Linear Spatial Equilibria, to appear in Discrete Applied Mathematics.Google Scholar
  16. Kennington, J.L. and R.V. Helgason. 1980. Algorithms for Network Programming, John Wiley & Sons, New York.Google Scholar
  17. Klincewicz, J.G. 1983. A Newton Method for Convex Separable Network Flow Problems, Network 13, 427–442.CrossRefGoogle Scholar
  18. Luss, H. and S. Gupta. 1975. Allocation of Effort Resources Among Competing Activities, Operations Research 23, 360–366.CrossRefGoogle Scholar
  19. Levitin, E.S. and B.T. Poljak. 1966. Constrained Minimization Problems, U.S.S.R. Computational Mathematics 6, 1–50.CrossRefGoogle Scholar
  20. Meyer, R.R. 1983. Computational Aspects of Two-Segment Separable Programming, Mathematical Programming 26, 21–39.CrossRefGoogle Scholar
  21. Murtagh, B.A. and M.A. Saunders. 1978. Large-Scale Linearly Constrained Optimization, Mathematical Programming 14, 41–72.CrossRefGoogle Scholar
  22. Pang, J.S. 1981. A Hybrid Method for the Solution of Some Multicommodity Spatial Equilibrium Problem, Management Science 27, 1142–1157.CrossRefGoogle Scholar
  23. Pang, J.S. 1984a. Solution of the General Multicommodity Spatial Equilibrium Problem by Variational and Complementarity Methods, Journal of Regional Science 24, 403–414.CrossRefGoogle Scholar
  24. Pang, J.S. 1984b. Asymmetric Variational Inequalities Over Product Sets, to appear in Mathematical Programming.Google Scholar
  25. Pang, J.S. and P.S.C. Lee. 1981. A Parametric Linear Complementarity Technique for the Computation of Equilibrium Prices in a Single Commodity Spatial Model, Mathematical Programming 29, 81–102.CrossRefGoogle Scholar
  26. Pang, J.S. and Y.Y. Lin. 1984. On the Convergence of Dual Ascent Methods for Large-Scale Linearly Constrained Optimization Problems, manuscript, School of Management, The University of Texas at Dallas.Google Scholar
  27. Rowse, J. 1982. On the Solution of Spatial Equilibrium Models, Decision Sciences 13, 619–637.Google Scholar
  28. Tobin, R.L. and T.L. Friesz. 1983. Formulating and Solving the Spatial Price Equilibrium Problem With Transshipment in Terms of Arc Variables, Journal of Regional Science 23, 187–198.CrossRefGoogle Scholar
  29. Zipkin, P. 1980. Simple Ranking Method for Allocation of one Resource, Management Science 26, 34–43.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Jong-Shi Pang
    • 1
  • Yuh-Yang Lin
    • 1
  1. 1.School of ManagementThe University of Texas at DallasRichardsonUSA

Personalised recommendations