A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
From MaRDI portal
Publication:2970402
DOI10.1080/02331934.2016.1269765zbMath1364.90276OpenAlexW2568448495MaRDI QIDQ2970402
Chun-Feng Wang, Pei-Ping Shen, Yan-Qin Bai
Publication date: 30 March 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1269765
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ 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 ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Cites Work
- Global minimization of a generalized linear multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- Global maximization of a generalized concave multiplicative function
- A global optimization approach for solving the convex multiplicative programming problem
- Global minimization of a generalized convex multiplicative function
- Image space analysis of generalized fractional programs
- Bilinear separation of two sets in \(n\)-space
- Solving long-term financial planning problems via global optimization
- Global optimization of multiplicative programs
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Finite algorithm for generalized linear multiplicative programming
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Global optimization method for linear multiplicative programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- Robust Optimization of Large-Scale Systems
