A Long View of Research and Practice in Operations Research and Management Science pp 23-33 | Cite as

# The Persistence and Effectiveness of Large-Scale Mathematical Programming Strategies: Projection, Outer Linearization, and Inner Linearization

## Abstract

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.

## Keywords

Column Generation SIAM Journal Interior Point Method Outer Approximation Cutting Plane Algorithm## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Abhishek K, Leyffer S, Linderoth JT (2008) FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs. Argonne National Laboratory, Mathematics and Computer Science Division Preprint ANL/MCS-P1374-0906, March 28Google Scholar
- 2.Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming 58:295–324CrossRefGoogle Scholar
- 3.Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch and price: Column generation for solving huge integer programs. Operations Research 46:316–329CrossRefGoogle Scholar
- 4.Bellman R (1957) Dynamic programming. Princeton University Press, Princeton, NJGoogle Scholar
- 5.Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238–252CrossRefGoogle Scholar
- 6.Bertsekas DP, Yu H (2009) A unifying polyhedral approximation framework for convex optimization. MIT Working Paper: Report LIDS–2820, SeptemberGoogle Scholar
- 7.Birge JR (1985) Decomposition and partitioning methods for multi-stage stochastic linear programs. Operations Research 33:989–1007CrossRefGoogle Scholar
- 8.Birge JR, Takriti S (1998) Successive approximations of linear control models. SIAM Journal of Control Optimization 37:165–176CrossRefGoogle Scholar
- 9.Birge JR, Zhao G (2007) Successive linear approximation solution of infinite-horizon dynamic stochastic programs. SIAM Journal of Optimization 18:1165–1186CrossRefGoogle Scholar
- 10.Bixby RE (2002) Solving real-world linear programs: A decade and more of progress. Operations Research 50:3–15CrossRefGoogle Scholar
- 11.Dantzig GB (1959) On the status of multistage linear programming problems. Management Science 6:53–72CrossRefGoogle Scholar
- 12.Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJGoogle Scholar
- 13.Dantzig GB, Madansky A (1961) On the solution of two–stage linear programs under uncertainty. Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CAGoogle Scholar
- 14.Dantzig GB, Wolfe P (1960) The decomposition principle for linear programs. Operations Research 8:101–111CrossRefGoogle Scholar
- 15.de Farias DP, Van Roy B (2003) The linear programming approach to approximate dynamic programming. Operations Research 51:850–865CrossRefGoogle Scholar
- 16.Duran MA, Grossmann I (1986) An outer-approximation algorithm for a class of mixed integer nonlinear programs. Mathematical Programming 36:307–339CrossRefGoogle Scholar
- 17.Fiacco Av, McCormick GP (1964) The sequential unconstrained minimization technique for nonlinear programing, a primal-dual method. Management Science 10:360–366CrossRefGoogle Scholar
- 18.Fletcher R, Leyffer S (1994) Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming 66:327–349CrossRefGoogle Scholar
- 19.Geoffrion AM (1970) Elements of large-scale mathematical programming. Management Science 16:652–675CrossRefGoogle Scholar
- 20.Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373–395CrossRefGoogle Scholar
- 21.Kelley JE (1960) The cutting plane method for solving convex programs. Journal of SIAM 8:703–712Google Scholar
- 22.Klabjan D, Adelman D (2007) An infinite dimensional linear programming algorithm for deterministic semi-Markov decision processes on Borel spaces. Mathematics of Operations Research 32:528–550CrossRefGoogle Scholar
- 23.Lovász L, Schrijver A (1991) Cones of matrices and set-functions and 0-1 optimization. SIAM Journal of Optimization 1:166–190CrossRefGoogle Scholar
- 24.Quesada I, Grossmann IE (1992) An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems. Computers and Chemical Engineering 16:937–947CrossRefGoogle Scholar
- 25.Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton, NJGoogle Scholar
- 26.Rosen JB (1963) Convex partition programming. In: Graves RL, Wolfe P (eds) Recent advances in mathematical programming. McGraw-Hill, New York, NYGoogle Scholar
- 27.Schweitzer P, Seidmann A (1985) Generalized polynomial approximations in Markovian decision processes. Journal of Mathematical Analysis Applications 110:568–582CrossRefGoogle Scholar
- 28.Sherali H, Adams W (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics 3:411–430CrossRefGoogle Scholar
- 29.Van Slyke R, Wets RJ-B (1969) L-shaped linear programs with application to optimal control and stochastic programming. SIAM Journal of Applied Mathematics 17:638–663CrossRefGoogle Scholar
- 30.Wilhelm WE (2001) A technical review of column generation in integer programming. Optimization and Engineering 2:1573–2924CrossRefGoogle Scholar