Linearization method for a class of multiplicative programming with exponent

DOI10.1016/J.AMC.2006.05.074MaRDI QIDQ864775zbMATH OpenOpenAlexFDO

Authors Peiping 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

algorithmbranch and boundconvergenceglobal optimizationlinear relaxationmultiplicative programmingnumerical examples

Mathematics Subject Classification ID

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

Recommendations

• Linear programming over exponent pairs
• A new linearization method for generalized linear multiplicative programming
• Linear multiplicative programming
• Multiplicative method for exact penalty functions for linear and integer linear programming problems
• A method of acceleration for a class of multiplicative programming problems with exponent
• EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING
• scientific article; zbMATH DE number 4059112
• A parametric method for solving linear multiplicative programming problem
• scientific article; zbMATH DE number 4074828
• Heuristic methods for linear multiplicative programming

Cites work

• A finite branch-and-bound algorithm for linear multiplicative programming
• 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
• Finite algorithm for generalized linear multiplicative programming
• Global optimization of multiplicative programs
• Heuristic methods for linear multiplicative programming
• scientific article; zbMATH DE number 1054671 (Why is no real title available?)
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Robust Optimization of Large-Scale Systems
• Solving long-term financial planning problems via global optimization

Cited in

(26)

• Global optimization for generalized linear multiplicative programming using convex relaxation
• A global optimization approach for solving generalized nonlinear multiplicative programming problem
• A multiplicative Gauss-Newton minimization algorithm: theory and application to exponential functions
• 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
• 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
• 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 duality bound method for solving concave multiplicative programming with exponents
• A new method for solving a class of multiplicative programming
• A branch-and-reduce approach for solving generalized linear multiplicative programming
• Solving generalized polynomial problem by using new affine relaxed technique
• An efficient algorithm for computing a class of multiplicative optimization problem
• A global optimization for a class of multiplicative programming problems
• Two-level linear relaxation method for generalized linear fractional programming
• A new linearization method for generalized linear multiplicative programming
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
• A method based on parametric convex programming for solving convex multiplicative programming problem
• A novel branch-and-bound algorithm for minimizing a class of generalized sum of linear ratio programming problems
• A new branch-and-bound algorithm for generalized affine multiplicative programming
• Globally minimizing a class of fractional multiplicative problems using the separability of relaxation problem
• A new accelerating method for globally solving a class of nonconvex programming problems

This page was built for publication: Linearization method for a class of multiplicative programming with exponent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864775)