The Cutting-Plane Method for Solving Convex Programs
James E. Kelley · Journal of the Society for Industrial and Applied Mathematics · 1960
Cited by 1,549 works. doi:10.1137/0108053
Authors
References
- Outline of an algorithm for integer solutions to linear programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The dual method of solving the linear programming problem
- Newton's method for convex programming and Tchebycheff approximation
- Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints
- An Application of Linear Programming to Curve Fitting
- Accelerating the Cutting Plane Method for Nonlinear Programming