Access the full text.
Sign up today, get DeepDyve free for 14 days.
W. Wilhelm (2001)
A Technical Review of Column Generation in Integer ProgrammingOptimization and Engineering, 2
C. Barnhart, Ellis Johnson, G. Nemhauser, M. Savelsbergh, P. Vance (1998)
Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOper. Res., 46
D. Klabjan, Daniel Adelman (2007)
An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel SpacesMath. Oper. Res., 32
J. Birge, S. Takriti (1999)
Successive Approximations of Linear Control ModelsSiam Journal on Control and Optimization, 37
S. Vajda (1964)
Recent Advances in Mathematical ProgrammingJournal of the Operational Research Society, 15
I. Quesada, I. Grossmann (1992)
An LP/NLP based branch and bound algorithm for convex MINLP optimization problemsComputers & Chemical Engineering, 16
G. Dantzig (1963)
23. A Decomposition Principle for Linear Programs
K. Abhishek, S. Leyffer, Jeff Linderoth (2008)
FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs
J. Birge, G. Zhao (2007)
Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic ProgramsSIAM J. Optim., 18
M. Duran, I. Grossmann (1986)
An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 36
E. Balas, Sebastián Ceria, G. Cornuéjols (1993)
A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 58
A. Geoffrion (1969)
Elements of large-scale mathematical programming
A. Geoffrion (1970)
Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 16
G. Dantzig, A. Madansky (1961)
ON THE SOLUTION OF TWO-STAGE LINEAR PROGRAMS UNDER UNCERTAINTY. NOTES ON LINEAR PROGRAMMING AND EXTENSIONS. PART 55
G. Dantzig (1965)
Linear programming and extensionsThe Mathematical Gazette, 49
A. Fiacco, G. McCormick (1964)
The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 10
N. Karmarkar (1984)
A new polynomial-time algorithm for linear programmingCombinatorica, 4
R. Slyke, R. Wets (1969)
L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING.Siam Journal on Applied Mathematics, 17
H. Sherali, Warren Adams (1990)
A hierarchy of relaxation between the continuous and convex hull representationsSIAM Journal on Discrete Mathematics, 3
J. Benders (1962)
Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 4
L. Lovász, A. Schrijver (1991)
Cones of Matrices and Set-Functions and 0-1 OptimizationSIAM J. Optim., 1
J. Birge (1985)
Decomposition and Partitioning Methods for Multistage Stochastic Linear ProgramsOper. Res., 33
R. Bellman (1957)
Dynamic ProgrammingScience, 153
G. Dantzig (1959)
On the Status of Multistage Linear Programming ProblemsManagement Science, 6
P. Schweitzer, A. Seidmann (1985)
Generalized polynomial approximations in Markovian decision processesJournal of Mathematical Analysis and Applications, 110
J. Kelley (1960)
The Cutting-Plane Method for Solving Convex ProgramsJournal of The Society for Industrial and Applied Mathematics, 8
G. Dantzig, P. Wolfe (1960)
Decomposition Principle for Linear ProgramsOperations Research, 8
R. Bixby (2002)
Solving Real-World Linear Programs: A Decade and More of ProgressOper. Res., 50
D. Bertsekas, Huizhen Yu (2011)
A Unifying Polyhedral Approximation Framework for Convex OptimizationSIAM J. Optim., 21
D. Farias, Benjamin Roy (2003)
The Linear Programming Approach to Approximate Dynamic ProgrammingOper. Res., 51
R. Fletcher, S. Leyffer (1994)
Solving mixed integer nonlinear programs by outer approximationMathematical Programming, 66
[Geoffrion [19] gave a framework for efficient solution of large-scale mathematical programming problems based on three principal approaches that he described as problem manipulations: projection, outer linearization, and inner linearization. These fundamental methods persist in optimization methodology and underlie many of the innovations and advances since Geoffrion’s articulation of their fundamental nature. This chapter reviews the basic principles in these approaches to optimization, their expression in a variety of methods, and the range of their applicability.]
Published: Aug 27, 2010
Keywords: Column Generation; SIAM Journal; Interior Point Method; Outer Approximation; Cutting Plane Algorithm
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.