Computational aspects of cutting-plane algorithms for geometric programming problems
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 13 (1) , 200-220
- https://doi.org/10.1007/bf01584337
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A linear programming approach to geometric programsNaval Research Logistics Quarterly, 1978
- A central cutting plane algorithm for the convex programming problemMathematical Programming, 1975
- Solution of generalized geometric programsInternational Journal for Numerical Methods in Engineering, 1975
- An approach to the numerical solutions of geometric programsMathematical Programming, 1974
- Generalized Cutting Plane AlgorithmsSIAM Journal on Control, 1971
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970
- Complementary Geometric ProgrammingSIAM Journal on Applied Mathematics, 1970
- Linearizing Geometric ProgramsSIAM Review, 1970
- Convex Programming by Tangential ApproximationManagement Science, 1963
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959