Management Science · 1976 · 63 citations · 16 references
Natural SciencesMathematicsAlgorithmsOptimizationPricing TheoryConvex AnalysisConvex OptimizationLinear ProgrammingMathematical ProgrammingOptimization In EconomicsOptimization TheoryDual Linear ProgrammingDuality TheoryMathematical Programming ModelsPrimal Linear Programming
The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general assumptions, it is demonstrated that any limit point of the sequence of optimal linear programming dual prices produced by the algorithm is optimal in a concave maximization problem that is dual to the arbitrary primal problem. This result holds even if the generalized linear programming problem does not solve the primal problem. The result is a consequence of the equivalence that exists between the operations of convexification and dualization of a primal problem. The exact mathematical nature of this equivalence is given.
16
Optimization by Vector Space Methods
Students Quarterly Journal · 1970 · 6.1K citations
Natural Sciences, Industrial Engineering, Design Optimization +6
Generalized Benders decomposition
Arthur M. Geoffrion · Journal of Optimization Theory and Applications · 1972 · 2.5K citations
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations
Nonlinear Programming: A Unified Approach
David W. Peterson, Willard I. Zangwill · Econometrica · 1972 · 1K citations