A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows

Optimization

Volumn 40, Issue 3, 1997, Pages 247-284

  Larsson, T ^a   Liu, Z ^a,b  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Ergodic results; Lagrangean duality; Lagrangean heuristic methods; Linear minimum cost multicommodity network flow problem; Linear programming; Subgradient optimization

Indexed keywords

EID: 0038969576     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939708844312     Document Type: Article

References (35)

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