Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
Published Online:1 Dec 1970https://doi.org/10.1287/opre.18.6.1216
- Cited by
- IEEE/ACM Transactions on Networking, Vol. 19, No. 2
- Journal of Computational and Applied Mathematics, Vol. 53, No. 1
- Trabajos de Investigacion Operativa, Vol. 4, No. 1
- Trabajos de Investigacion Operativa, Vol. 4, No. 1
- Mathematical Programming, Vol. 36, No. 3
- Journal of Optimization Theory and Applications, Vol. 46, No. 1
- Journal of Optimization Theory and Applications, Vol. 36, No. 1
- Mathematical Programming, Vol. 13, No. 1
- Journal of Optimization Theory and Applications, Vol. 19, No. 2
- Mathematical Programming, Vol. 8, No. 1
- Mathematical Programming, Vol. 5, No. 1
- 3 August 2013 | Journal of Optimization Theory and Applications, Vol. 12, No. 1
Volume 18, Issue 6
November-December 1970
Pages 967-1235
Article Information
Metrics
Information
- Published Online:December 01, 1970
© 1970 INFORMS
Cite as
Donald M. Topkis, (1970) Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets. Operations Research 18(6):1216-1220.
https://doi.org/10.1287/opre.18.6.1216
