Global optimization algorithm for a generalized linear multiplicative programming
From MaRDI portal
Publication:2511121
DOI10.1007/s12190-012-0576-6zbMath1295.90082OpenAlexW2010614651MaRDI QIDQ2511121
Hong-Wei Jiao, San-Yang Liu, Yong-Qiang Chen
Publication date: 5 August 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-012-0576-6
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items (11)
Global optimization algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An out space accelerating algorithm for generalized affine multiplicative programs problem ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ Approximating a linear multiplicative objective in watershed management optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global minimization of a generalized linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A new accelerating method for globally solving a class of nonconvex programming problems
- Global maximization of a generalized concave multiplicative function
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- An outcome space approach for generalized convex multiplicative programs
- A nonisolated optimal solution of general linear multiplicative programming problems
- A parametric successive underestimation method for convex multiplicative programming problems
- Linear multiplicative programming
- Global minimization of a generalized convex multiplicative function
- Optimization on low rank nonconvex structures
- Generalized convex multiplicative programming via quasiconcave minimization
- Solving long-term financial planning problems via global optimization
- Global optimization of multiplicative programs
- A unified monotonic approach to generalized linear fractional programming
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Finite algorithm for generalized linear multiplicative programming
- A numerical solution method to interval quadratic programming
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- A decomposition algorithm for solving large-scale quadratic programming problems
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- \(NP\)-hardness of linear multiplicative programming and related problems
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Robust Optimization of Large-Scale Systems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
This page was built for publication: Global optimization algorithm for a generalized linear multiplicative programming