A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows

References

• Allen E. P. Using two sequences of pure network problems to solve the multicommodity network flow problem Department of Operations Research, School of Engineering and Applied Science, Southern Methodist University Dallas, TX 1985 Ph.D. Dissertation
   Google Scholar
• Bazaraa , M.S. and Sherali , H.D. 1981 . On the choice of step size in subgradient optimization . European Journal of Operational Research , 7 : 380 – 388 .
   Web of Science ®Google Scholar
• Bazaraa , M.S. and Shetty , C.M. 1979 . “ Nonlinear Programming: Theory and Algorithms ” . New York : John Wiley & Sons .
   Google Scholar
• Baumol , W.J. and Fabian , T. 1964 . Decomposition, pricing for decentralization, and external economies . Management Science , 11 : 1 – 32 .
   Google Scholar
• Bertsekas , D.P. 1982 . “ Constrained Optimization and Lagrange Multiplier Methods ” . San Diego, CA : Academic Press .
   Google Scholar
• Cornuejols , G. , Fisher , M.L. and Nemhauser , G.L. 1977 . Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms . Management Science , 23 : 789 – 810 .
   Web of Science ®Google Scholar
• Dantzig , G.B. and Wolfe , P. 1960 . Decomposition principle for linear programs . Operations Research , 8 : 101 – 111 .
   Web of Science ®Google Scholar
• Dantzig , G.B. 1961 . The decomposition algorithm for linear programs . Econometrica , 29 : 767 – 778 .
   Web of Science ®Google Scholar
• Dem’yanov , V.F. and Vasil’ev , L.V. 1985 . Nondifferentiable Optimization , New York : Optimization Software .
   Google Scholar
• Dirickx , Y.M.I. and Jennergren , L.P. 1979 . “ Systems Analysis by Multilevel Methods ” . Chichester : John Wiley & Sons .
   Google Scholar
• Feinberg , B. 1989 . Coercion functions and decentralized linear programming . Mathematics of Operations Research , 14 : 177 – 187 .
   Google Scholar
• Fisher , M.L. 1981 . The Lagrangean relaxation method for solving integer programming problems . Management Science , 27 : 1 – 18 .
   Web of Science ®Google Scholar
• Fisher , M.L. 1985 . An applications oriented guide to Lagrangean relaxation . Interfaces , 15 : 10 – 21 .
   Web of Science ®Google Scholar
• Geoffrion , A.M. 1974 . Lagrangian relaxation for integer programming . Mathematical Programming Study , 2 : 82 – 114 .
   Google Scholar
• Graves , S.C. 1982 . Using Lagrangian techniques to solve hierarchical production planning problems . Management Science , 28 : 260 – 275 .
   Web of Science ®Google Scholar
• Grigoriadis , M.D. and White , W.W. 1972 . A partitioning algorithm for the multicommodity network flow problem . Mathimatical Programming , 3 : 157 – 177 .
   Google Scholar
• Gunn , E.A. , Thorburn , M. and Rai , A.K. 1988 . decomposition method based on the augmented Lagrangian . INFOR , 26 : 91 – 113 .
   Web of Science ®Google Scholar
• Held , M. , Wolfe , P. and Crowder , H.P. 1974 . Validation of subgradient optimization . Mathematical Programming , 6 : 62 – 88 .
   Google Scholar
• Jennergren , L.P. 1972 . Decentralization on the basis of price schedules in linear decomposable resource allocation problems . Journal of Financial and Quantitatice Analysis , 7 : 1407 – 1417 .
   Google Scholar
• Jennergren , L.P. 1973 . price schedules decomposition algorithm for linear programming problems . Econometrica , 41 : 965 – 979 .
   Google Scholar
• Kennington , J.L. 1978 . A survey of linear cost multicommodity network flows . Operations Research , 26 : 209 – 236 .
   Web of Science ®Google Scholar
• Kennington , J.L. and Helgason , R.V. 1980 . Algorithms for Network Programming , New York : John Wiley & Sons .
   Google Scholar
• Kennington , J.L. and Shalaby , M. 1977 . An effective subgradient procedure for minimal cost multicommodity flow problems . Management Science , 23 : 994 – 1004 .
   Web of Science ®Google Scholar
• Kornai , J. and Lipták , T. 1965 . Two level planning . Econometrica , 33 : 141 – 169 .
   Web of Science ®Google Scholar
• Lasdon , L.S. 1970 . Optimization Theory for Large Systems , New York : Mac Millan .
   Google Scholar
• Mangasarian , O.L. 1981 . Iterative solution of linear programs . SIAM Journal on Numerical Analysis , 18 : 606 – 614 .
   Web of Science ®Google Scholar
• Marsten , R.E. 1981 . The design of the XMP linear programming library . ACM Transactions on Mathematical Software , 7 : 481 – 497 .
   Web of Science ®Google Scholar
• Minoux , M. 1986 . Mathematical Programming: Theory and Algorithms , New York : John Wiley & Sons .
   Google Scholar
• Polyak , B.T. 1969 . Minimization of unsmooth functionals . USSR Computational Mathematics and Mathematical Physics , 9 : 14 – 29 .
   Google Scholar
• Rockafellar , R.T. 1984 . Network Flows and Monotropic Optimization , New York : John Wiley & Sons .
   Google Scholar
• Ruszczynski , A. 1989 . An augmented Lagrangean decomposition method for block diagonal linear programming problems . Operations Research Letters , 8 : 287 – 294 .
   Google Scholar
• Saviozzi , G. 1986 . Advanced start for the multicommodity network flow problem . Mathematical Programming Study , 26 : 221 – 224 .
   Web of Science ®Google Scholar
• Shor , N.Z. 1985 . Minimization Methods for Non–Differentiable Functions , Berlin : Springer–Verlag . Translated from the Russian by K.C. Kiwiel and A. Ruzyczynski
   Google Scholar
• Tomlin , J.A. 1966 . Minimum cost multicommodity network flows . Operations Research , 14 : 45 – 51 .
   Web of Science ®Google Scholar
• Wollmer , R.D. 1972 . Multicommodity network with resource constraints: the generalized multicommodity flow problem . Networks , 1 : 245 – 263 .
   Google Scholar