Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints

DOI10.1016/J.APM.2015.03.025zbMath1443.90037OpenAlexW1976294619MaRDI QIDQ2285918

Yingfeng Zhao, San-Yang Liu, Hong-Wei Jiao

Publication date: 9 January 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2015.03.025

zbMATH Keywords

global optimizationbranch and boundgeneralized linear multiplicative problemlinear lower bound relaxation problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Related Items (19)

An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ An out space accelerating algorithm for generalized affine multiplicative programs problem ⋮ An effective algorithm for globally solving sum of linear ratios problems ⋮ Inner approximation algorithm for generalized linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ Approximating a linear multiplicative objective in watershed management optimization

Cites Work

• Global optimization of signomial geometric programming problems
• A practicable branch and bound algorithm for sum of linear ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
• Global minimization of a generalized linear multiplicative programming
• On the global optimization of sums of linear fractional functions over a convex set
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• A FPTAS for a class of linear multiplicative problems
• An outcome-space finite algorithm for solving linear multiplicative programming
• Global optimization of generalized linear fractional programming with nonlinear constraints
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A deterministic global optimization algorithm
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
• Global optimization for special reverse convex programming
• A robust algorithm for generalized geometric programming
• A new global optimization approach for convex multiplicative programming
• A nonisolated optimal solution of general linear multiplicative programming problems
• Comparison of generalized geometric programming algorithms
• Handbook of test problems in local and global optimization
• Global optimization of nonconvex polynomial programming problems having rational exponents
• Global optimization of multiplicative programs
• A unified monotonic approach to generalized linear fractional programming
• Global optimization of signomial geometric programming using linear relaxation.
• A global optimization algorithm for signomial geometric programming problem
• A novel optimization method for nonconvex quadratically constrained quadratic programs
• Fuzzy pricing, marketing and service planning in a fuzzy inventory model: a geometric programming approach
• Finite algorithm for generalized linear multiplicative programming
• Multi-objective geometric programming problem with \(\epsilon\)-constraint method
• Generalized linear multiplicative and fractional programming
• An efficient convexification method for solving generalized geometric problems
• Branch-reduction-bound algorithm for generalized geometric programming
• A global optimization using linear relaxation for generalized geometric programming
• Accelerating method of global optimization for signomial geometric programming
• Global optimization algorithm for a generalized linear multiplicative programming
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A new linearization technique for minimax linear fractional programming

This page was built for publication: Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints