Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
- 1 March 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 49 (1-3) , 3-23
- https://doi.org/10.1016/0166-218x(94)90198-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Cutting planes and column generation techniques with the projective algorithmJournal of Optimization Theory and Applications, 1990
- A polynomial newton method for linear programmingAlgorithmica, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959