A parametric successive underestimation method for convex multiplicative programming problems
- 1 January 1991
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 1 (3) , 267-285
- https://doi.org/10.1007/bf00119935
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Parametric simplex algorithms for solving a special class of nonconvex minimization problemsJournal of Global Optimization, 1991
- Generalized linear multiplicative and fractional programmingAnnals of Operations Research, 1990
- Global OptimizationPublished by Springer Nature ,1990
- On a class of quadratic programsEuropean Journal of Operational Research, 1984
- On finding Most Optimal Rectangular Package PlansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Quasi-concavity and pseudo-concavity of cubic functionsMathematical Programming, 1973
- Solving Bicriterion Mathematical ProgramsOperations Research, 1967
- Function minimization by conjugate gradientsThe Computer Journal, 1964