Generalized convex multiplicative programming via quasiconcave minimization
From MaRDI portal
Publication:1359123
DOI10.1023/A:1008203116882zbMath0871.90085MaRDI QIDQ1359123
Hoang Tuy, Brigitte Jaumard, Christophe Meyer
Publication date: 24 June 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationbranch-and-boundconical partitionquasiconcave minimizationgeneralized convex multiplicative programmingsum of a convex function and a product of \(k\) nonnegative convex functions
Related Items
Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set, Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming, A convex analysis approach for convex multiplicative programming, An objective space cut and bound algorithm for convex multiplicative programmes, An outcome space approach for generalized convex multiplicative programs, A new global optimization approach for convex multiplicative programming, A new two-level linear relaxed bound method for geometric programming problems, Global optimization algorithm for a generalized linear multiplicative programming, Solving generalized convex multiobjective programming problems by a normal direction method, Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
Uses Software
