Multiplicative programming problems: Analysis and efficient point search heuristic
From MaRDI portal
Publication:1367730
DOI10.1023/A:1022600232285zbMath0889.90128OpenAlexW167138647MaRDI QIDQ1367730
Publication date: 4 June 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022600232285
global optimizationconcave minimizationheuristic algorithmsmultiple objectivesefficient pointsmultiplicative programming
Related Items
Theoretical and computational results about optimality-based domain reductions, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A FPTAS for a class of linear multiplicative problems, An outcome-space finite algorithm for solving linear multiplicative programming, An FPTAS for optimizing a class of low-rank functions over a polytope, Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, A global optimization approach for solving generalized nonlinear multiplicative programming problem, Solving a class of multiplicative programs with 0-1 knapsack constraints, Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm, A convex analysis approach for convex multiplicative programming, An objective space cut and bound algorithm for convex multiplicative programmes, Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities, Duality for linear multiplicative programs, A new two-level linear relaxed bound method for geometric programming problems, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Global optimization of nonlinear sums of ratios, A nonisolated optimal solution of general linear multiplicative programming problems, Global Optimization of Linear Multiplicative Programming Using Univariate Search, Solving generalized convex multiobjective programming problems by a normal direction method, Outcome-space cutting-plane algorithm for linear multiplicative programming, On computational solution of vector maximum problem, Level set algorithm for solving convex multiplicative programming problems, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints, Global optimization method for linear multiplicative programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Theory of multiobjective optimization
- On a class of quadratic programs
- Constrained global optimization: algorithms and applications
- Multiobjective programming and planning
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- A parametric successive underestimation method for convex multiplicative programming problems
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Linear multiplicative programming
- Existence of efficient solutions for vector maximization problems
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Solving a class of multiplicative programming problems via \(C\)- programming
- Finite algorithm for generalized linear multiplicative programming
- A branch-and-reduce approach to global optimization
- Generalized linear multiplicative and fractional programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- An efficient solution method for rank two quasiconcave minimization problems
- Deterministic algorithms for constrained concave minimization: A unified critical survey
- Algorithms for the vector maximization problem
- A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE
- Convex Analysis
