A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
From MaRDI portal
Publication:6601128
DOI10.1007/s40840-024-01730-3MaRDI QIDQ6601128
Publication date: 10 September 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- An outcome-space finite algorithm for solving linear multiplicative programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Global maximization of a generalized concave multiplicative function
- Practical global optimization for multiview geometry
- An outcome space approach for generalized convex multiplicative programs
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Linear multiplicative programming
- A mean-absolute deviation-skewness portfolio optimization model
- Bilinear separation of two sets in \(n\)-space
- Global optimization of multiplicative programs
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- Global algorithm for solving linear multiplicative programming problems
- Generalized linear multiplicative and fractional programming
- Global optimization method for linear multiplicative programming
- Global optimization of a rank-two nonconvex program
- \(NP\)-hardness of linear multiplicative programming and related problems
- 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
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Robust Optimization of Large-Scale Systems
- Global optimization algorithm for solving linear multiplicative programming problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Convex analysis and global optimization
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- 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
This page was built for publication: A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
