A global optimization approach for solving the convex multiplicative programming problem
From MaRDI portal
Publication:1200524
Recommendations
Cites work
- scientific article; zbMATH DE number 3761779 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3466822 (Why is no real title available?)
- scientific article; zbMATH DE number 3227649 (Why is no real title available?)
- A method for globally minimizing concave functions over convex sets
- A parametric successive underestimation method for convex multiplicative programming problems
- An efficient solution method for rank two quasiconcave minimization problems
- Concave minimization under linear constraints with special structure
- Convex Analysis
- Minimization of ratios
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On a class of quadratic programs
- On an outer approximation concept in global optimization
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Outer approximation by polyhedral convex sets
- The relief indicator method as a new approach to constrained global optimization
Cited in
(46)- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- Global optimization for D.C. multiplicative programming
- scientific article; zbMATH DE number 1799337 (Why is no real title available?)
- Solving a class of multiplicative programming problems via \(C\)- programming
- Global Optimization of Convex Multiplicative Programs by Duality Theory
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- An objective space cut and bound algorithm for convex multiplicative programmes
- A branch-and-reduce approach to global optimization
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- scientific article; zbMATH DE number 6501301 (Why is no real title available?)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- A finite algorithm for a class of nonlinear multiplicative programs
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An accelerating algorithm for globally solving nonconvex quadratic programming
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- A new global optimization approach for convex multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- The simplex method as a global optimizer: A \(C\)-programming perspective
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Level set algorithm for solving convex multiplicative programming problems
- A nonisolated optimal solution of general linear multiplicative programming problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Constraint decomposition algorithms in global optimization
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Global optimization method for linear multiplicative programming
- A parametric successive underestimation method for convex multiplicative programming problems
- The optimal level solution method applied to a non linear programming problem with exponential objective function
- Duality for linear multiplicative programs
- Decomposition approach for the global minimization of biconcave functions over polytopes
- A convex analysis approach for convex multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- Global minimization of a generalized linear multiplicative programming
- A method based on parametric convex programming for solving convex multiplicative programming problem
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
This page was built for publication: A global optimization approach for solving the convex multiplicative programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200524)
