Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
From MaRDI portal
Publication:6614694
DOI10.1007/s10957-024-02461-yMaRDI QIDQ6614694
Unnamed Author, Yuelin Gao, Hong-Yu Wang
Publication date: 7 October 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- A new linearization method for generalized linear multiplicative programming
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- A new global optimization approach for convex multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Vector maximization with two objective functions
- Global minimization of a generalized convex multiplicative function
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Solving long-term financial planning problems via global optimization
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- 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
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- \(NP\)-hardness of linear multiplicative programming and related problems
- Level set algorithm for solving convex multiplicative programming problems
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- Necessary conditions for ε-optimality
- Robust Optimization of Large-Scale Systems
- Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
- Analysis of bounds for multilinear functions
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
This page was built for publication: Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs