An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
DOI10.1016/j.cam.2023.115100zbMath1512.90223OpenAlexW4319072617MaRDI QIDQ6099489
Dianxiao Wu, Pei-Ping Shen, Yafei Wang
Publication date: 20 June 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2023.115100
branch-and-boundlinear multiplicative programmingpiecewise linear approximationadaptive branchingsecond order cone relaxation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Global minimization of a generalized linear multiplicative programming
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Linear decomposition approach for a class of nonconvex programming problems
- An outer approximation method for minimizing the product of several convex functions on a convex set
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Generalized convexity and optimization. Theory and applications
- An outcome space approach for generalized convex multiplicative programs
- A new global optimization approach for convex multiplicative programming
- Bilinear separation of two sets in \(n\)-space
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Solving long-term financial planning problems via global optimization
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Global optimization for generalized linear multiplicative programming using convex relaxation
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Finite algorithm for generalized linear multiplicative programming
- BARON: A general purpose global optimization software package
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A method of acceleration for a class of multiplicative programming problems with exponent
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- Global optimization algorithm for a generalized linear multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- On the minimization of a class of generalized linear functions on a flow polytope
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
- Robust Optimization of Large-Scale Systems
- Global optimization algorithm for solving linear multiplicative programming problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
This page was built for publication: An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
