Outer space branch and bound algorithm for solving linear multiplicative programming problems
From MaRDI portal
Publication:2022174
Recommendations
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Outcome-space outer approximation algorithm for linear multiplicative programming
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- scientific article; zbMATH DE number 7267293
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A new branch and bound algorithm for linear multiplicative programming
- Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A nonisolated optimal solution of general linear multiplicative programming problems
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- An FPTAS for minimizing the product of two non-negative linear cost functions
- An outcome space approach for generalized convex multiplicative programs
- BARON: A general purpose global optimization software package
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Branch-reduction-bound algorithm for generalized geometric programming
- Convex analysis and global optimization
- Finite algorithm for generalized linear multiplicative programming
- Generalized convexity and optimization. Theory and applications
- Global algorithm for solving linear multiplicative programming problems
- Global minimization of a generalized linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Global optimization method for linear multiplicative programming
- Global optimization of a rank-two nonconvex program
- Global optimization of multiplicative programs
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- Linear decomposition approach for a class of nonconvex programming problems
- Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the minimization of a class of generalized linear functions on a flow polytope
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Range division and contraction algorithm for a class of global optimization problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Robust Optimization of Large-Scale Systems
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Solving long-term financial planning problems via global optimization
Cited in
(30)- 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
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- Outcome-space outer approximation algorithm for linear multiplicative programming
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- A criterion space algorithm for solving linear multiplicative programming problems
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- A method based on parametric convex programming for solving convex multiplicative programming problem
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- An adaptive optimization algorithm to solve a class of linear multiplicative problems
- An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs
- A branch-reduction-bound algorithm for linear fractional multi-product planning problems
- A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework
- A new branch and bound method for solving linear multiplicative programming problems
- Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- An outcome space algorithm for solving general linear multiplicative programming
- Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- Globally minimizing a class of linear multiplicative programming under the flexible branching scheme
This page was built for publication: Outer space branch and bound algorithm for solving linear multiplicative programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022174)
