The Cutting-Plane Method for Solving Convex Programs
- 1 December 1960
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Journal of the Society for Industrial and Applied Mathematics
- Vol. 8 (4) , 703-712
- https://doi.org/10.1137/0108053
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear ConstraintsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959
- An Application of Linear Programming to Curve FittingJournal of the Society for Industrial and Applied Mathematics, 1958
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958
- The generalized simplex method for minimizing a linear form under linear inequality restraintsPacific Journal of Mathematics, 1955
- The dual method of solving the linear programming problemNaval Research Logistics Quarterly, 1954