Global optimization method for linear multiplicative programming
From MaRDI portal
Publication:2355349
DOI10.1007/s10255-015-0456-6zbMath1317.90249OpenAlexW2115855742MaRDI QIDQ2355349
Kun Wu, Xue-Gang Zhou, Bing-Yuan Cao
Publication date: 22 July 2015
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-015-0456-6
Related Items (5)
Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ A practicable branch-and-bound algorithm for globally solving linear multiplicative programming ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
Cites Work
- Unnamed Item
- Unnamed Item
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Linearization method for a class of multiplicative programming with exponent
- Global maximization of a generalized concave multiplicative function
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Global minimization of a generalized convex multiplicative function
- Image space analysis of generalized fractional programs
- Bilinear separation of two sets in \(n\)-space
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Solving long-term financial planning problems via global optimization
- Global optimization of multiplicative programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Finite algorithm for generalized linear multiplicative programming
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Generalized linear multiplicative and fractional programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- \(NP\)-hardness of linear multiplicative programming and related problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Robust Optimization of Large-Scale Systems
- Convex analysis and global optimization
This page was built for publication: Global optimization method for linear multiplicative programming
