A branch and bound algorithm for globally solving a class of nonconvex programming problems

DOI10.1016/j.na.2008.02.005zbMath1155.90459OpenAlexW2059496069MaRDI QIDQ2518145

Hong-Wei Jiao

Publication date: 13 January 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2008.02.005

zbMATH Keywords

global optimizationnonconvex programmingbranch-and-boundlinear relaxation

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (26)

A practicable branch and bound algorithm for sum of linear ratios problem ⋮ 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 ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ A new linearization technique for minimax linear fractional programming ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ A new linearization method for generalized linear multiplicative programming ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ A branch-and-reduce approach for solving generalized linear multiplicative programming ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ A new accelerating method for globally solving a class of nonconvex programming problems ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ A deterministic method for solving the sum of linear ratios problem ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An effective algorithm for globally solving sum of linear ratios problems ⋮ Fixed input allocation methods based on super CCR efficiency invariance and practical feasibility ⋮ Inner approximation algorithm for generalized linear multiplicative programming problems ⋮ A parametric solution method for a generalized fractional programming problem ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ Global optimization for generalized geometric programming problems with discrete variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• 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 rectangle branch-and-pruning approach for generalized geometric programming
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• Prediction of oligopeptide conformations via deterministic global optimization
• 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
• Finite algorithm for generalized linear multiplicative programming
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A deterministic global optimization algorithm for generalized geometric programming
• Robust Optimization of Large-Scale Systems
• A finite branch-and-bound algorithm for linear multiplicative programming

This page was built for publication: A branch and bound algorithm for globally solving a class of nonconvex programming problems