×

zbMATH — the first resource for mathematics

Generalized Benders decomposition. (English) Zbl 0229.90024

MSC:
90C05 Linear programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Geoffrion, A. M.,Elements of Large-Scale Mathematical Programming, Management Science, Vol. 16, No. 11, 1970. · Zbl 0209.22801
[2] Benders, J. F.,Partitioning Procedures for Solving Mixed-Variables Programming Problems, Numerische Mathematik, Vol. 4, 1962. · Zbl 0109.38302
[3] Wilson, R. Programming Variable Factors, Management Science, Vol. 13, No. 1, 1966. · Zbl 0143.42201
[4] Balas, E.,Duality in Discrete Programming: IV. Applications, Carnegie-Mellon University, Graduate School of Industrial Administration, Report No. 145, 1968.
[5] Meyer, R.,The Validity of a Family of Optimization Methods, SIAM Journal on Control, Vol. 8, No. 1, 1970. · Zbl 0194.20501
[6] Dantzig, G. B.,Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963. · Zbl 0108.33103
[7] Geoffrion, A. M.,Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems, Operations Research, Vol. 18, No. 3, 1970. · Zbl 0201.22301
[8] Hogan, W.,Application of a General Convergence Theory for Outer Approximation Algorithms, University of California at Los Angeles, Western Management Science Institute, Working Paper No. 174, 1971.
[9] Eaves, B. C., andZangwill, W. I.,Generalized Cutting Plane Algorithms, SIAM Journal on Control, Vol. 9, No. 4, 1971.
[10] Geoffrion, A. M.,A New Global Optimization Technique for Gaseous Diffusion Plant Operation and Capital Investment, University of California at Los Angeles, Graduate School of Business Administration, Discussion Paper, 1970.
[11] Geoffrion, A. M.,Duality in Nonlinear Programming: A Simplified Application-Oriented Development, SIAM Review, Vol. 13, No. 1, 1971. · Zbl 0232.90049
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.