A global optimization approach for solving the convex multiplicative programming problem
From MaRDI portal
Publication:1200524
DOI10.1007/BF00130830zbMATH Open0752.90056OpenAlexW2058558758MaRDI QIDQ1200524FDOQ1200524
Authors: Nguyen Van Thoai 
Publication date: 16 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00130830
Recommendations
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient solution method for rank two quasiconcave minimization problems
- A method for globally minimizing concave functions over convex sets
- A parametric successive underestimation method for convex multiplicative programming problems
- Title not available (Why is that?)
- On a class of quadratic programs
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Concave minimization under linear constraints with special structure
- On an outer approximation concept in global optimization
- Title not available (Why is that?)
- Minimization of ratios
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- The relief indicator method as a new approach to constrained global optimization
Cited In (46)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- An accelerating algorithm for globally solving nonconvex quadratic programming
- A new global optimization approach for convex multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A branch-and-reduce approach for solving generalized linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- Title not available (Why is that?)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- Title not available (Why is that?)
- Global optimization for D.C. multiplicative programming
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- A finite algorithm for a class of nonlinear multiplicative programs
- Global optimization method for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Decomposition approach for the global minimization of biconcave functions over polytopes
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- A convex analysis approach for convex multiplicative programming
- Global minimization of a generalized linear multiplicative programming
- An objective space cut and bound algorithm for convex multiplicative programmes
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- The simplex method as a global optimizer: A \(C\)-programming perspective
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A parametric successive underestimation method for convex multiplicative programming problems
- A method based on parametric convex programming for solving convex multiplicative programming problem
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Duality for linear multiplicative programs
- A branch-and-reduce approach to global optimization
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- Solving a class of multiplicative programming problems via \(C\)- programming
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Constraint decomposition algorithms in global optimization
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- The optimal level solution method applied to a non linear programming problem with exponential objective function
- Level set algorithm for solving convex multiplicative programming problems
- Global Optimization of Convex Multiplicative Programs by Duality Theory
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
- Global optimization for generalized linear multiplicative programming using convex relaxation
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)
