Abstract
Gauss—Seidel type relaxation techniques are applied in the context of strictly convex pure networks with separable cost functions. The algorithm is an extension of the Bertsekas—Tseng approach for solving the linear network problem and its dual as a pair of monotropic programming problems. The method is extended to cover the class of generalized network problems. Alternative internal tactics for the dual problem are examined. Computational experiments —aimed at the improved efficiency of the algorithm — are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Ahlfeld, R.S. Dembo, J.M. Mulvey and S.A. Zenios, Nonlinear programming on generalized networks, Engineering Management Systems Working Paper, Princeton University (1985).
D.P. Bertsekas and M.E. Gafni, Projected Newton methods and optimization of multicommodity flows, IEEE Trans, of Automatic Control, Vol. AC-28, No. 12 (1983).
D.P. Bertsekas and P. Tseng, Relaxation methods for minimum cost network flow problems, MIT Report LIDS-P-1339 (1983).
D.P. Bertsekas and D. El Baz, Distributed asynchronous relaxation methods for convex network flow problems, MIT Report LIDS-P-1417 (1984).
G. Birkhoff and J.B. Diaz, Nonlinear network problems, Quarterly of Applied Mathematics 13(1956)431.
G.G. Brown and R.D. McBride, Solving generalized networks, Management Science 30, 12(1984).
R.S. Dem bo and J.G. Klincewicz, A scaled reduced gradient algorithm for network flow problems with convex separable costs, Mathematical Programming Studies 15(1981)125.
R.S. Dembo, A primal truncated Newton algorithm for large-scale nonlinear network optimization, Yale School of Organization and Management Working Paper, Series B 72 (1983).
R.S. Dembo,NLPNET User’s Manual, Version 3 (School of Organization and Management, Yale University, 1983).
F. Glover, J. Hultz, D. Klingman and J. Stutz, Generalized networks: A fundamental computer-based planning tool, Management Science 24, 12(1972)171.
D.W. Hearn, S. Lawphongpanich and J.A. Ventura, Restricted simplicial decomposition: Computation and extension, Research Report No. 84-38, University of Florida, Gainesville (1984).
C.A. Holloway, An extension of the Frank-Wolfe method of feasible directions, Mathematical Programming 6, 1(1974)14.
J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1980).
D. Klingman, A. Napier and J. Stutz, NETGEN — A program for generating large-scale (un)capacitated assignment, transportation, and minimum cost flow network problems, Management Science 20(1974)814.
L.S. Lasdon,Optimization Theory for Large Systems (McMillan Series in Operations Research, New York, 1970).
D.G. Luenberger,Linear and Nonlinear Programming (Addison-Wesley, Massachusetts, 1984).
J.M. Mulvey, Pivot strategies for primal-simplex network codes, Journal of the Association of Computing Machinery 25, 2(1978).
J.M. Mulvey and S. Zenios, Solving large-scale generalized networks, Journal of Information and Optimization Science 6(1985)95.
A. Ohuchi and I. Kaji, Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs, Networks 14(1984)515.
J.M. Ortega and W.C. Reinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).
R.T. Rockafellar,Convex Analysis (Princeton University Press, New Jersey, 1970).
R.T. Rockafellar, Monotropic programming: Descent algorithms and duality,in: Nonlinear Programming 4, ed. O.L. Mangasarian, R. Meyer and S. Robinson (Academic Press, New York, 1981) p. 327.
R.T. Rockafellar,Network Rows and Monotropic Programming (Wiley, New York, 1984).
T.E. Stern, A class of decentralized routing algorithms using relaxation, IEEE Trans, on Communications, Vol. COM-25, No. 10 (1977).
S.A. Zenios and J.M. Mulvey, Simulation of distributed synchronous relaxation techniques for convex network problems, Engineering Management Systems Working Paper, Princeton University (1985).
B. von Hohenbalken, Simplicial decomposition in nonlinear programming algorithms, Mathematical Programming 13(1977)49.
B.A. Murtagh and M.A. Saunders, MINOS user’s guide, Report SOL 77-9, Department of Operations Research, Stanford University, California (1977).
J.M. Mulvey, S.A. Zenios and D. Ahlfeld, Simplicial decomposition for convex generalized networks, Engineering Management Systems Working Paper, Princeton University (1985).
R.P. Brent, An algorithm with guaranteed convergence for finding the zero of a function, The Computer Journal 14, 4(1975).
Author information
Authors and Affiliations
Additional information
This research was supported in part by National Science Foundation Grant No. DCR-8401098-A0l.
Rights and permissions
About this article
Cite this article
Zenios, S.A., Mulvey, J.M. Relaxation techniques for strictly convex network problems. Ann Oper Res 5, 517–538 (1986). https://doi.org/10.1007/BF02739237
Issue Date:
DOI: https://doi.org/10.1007/BF02739237