Linearization method for a class of multiplicative programming with exponent

DOI10.1016/j.amc.2006.05.074zbMath1110.65051OpenAlexW2044670240MaRDI QIDQ864775

Pei-Ping Shen, Hong-Wei Jiao

Publication date: 13 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.074

zbMATH Keywords

algorithmglobal optimizationconvergencenumerical examplesbranch and boundlinear relaxationmultiplicative programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ A method of acceleration for a class of multiplicative programming problems with exponent ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ A new linearization method for generalized linear multiplicative programming ⋮ A branch-and-reduce approach for solving generalized linear multiplicative programming ⋮ A new accelerating method for globally solving a class of nonconvex programming problems ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ A variant of trust-region methods for unconstrained optimization ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ Global optimization method for linear multiplicative programming

Cites Work

• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Solving long-term financial planning problems via global optimization
• Global optimization of multiplicative programs
• Heuristic methods for linear multiplicative programming
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Finite algorithm for generalized linear multiplicative programming
• Robust Optimization of Large-Scale Systems
• A finite branch-and-bound algorithm for linear multiplicative programming