An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
From MaRDI portal
Recommendations
- An output-space branch-and-bound algorithm for finding the global solution of the sum-of-linear-ratios problem
- A practicable branch and bound algorithm for sum of linear ratios problem
- A global optimization algorithm for sum of linear ratios problem
- A new global algorithm for the sum of linear ratios problem
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
Cites work
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- A practicable branch and bound algorithm for sum of linear ratios problem
- A unified monotonic approach to generalized linear fractional programming
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- An interior-point method for generalized linear-fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Downside risk approach for multi-objective portfolio optimization
- Duality in Fractional Programming: A Unified Approach
- Image space analysis of generalized fractional programs
- Integrated data envelopment analysis: global vs. local optimum
- Mathematical optimization ideas for biodiversity conservation
- Minimization of the sum of three linear fractional functions
- Network data envelopment analysis: a review
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- On the global optimization of sums of linear fractional functions over a convex set
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Programming with linear fractional functionals
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(7)- scientific article; zbMATH DE number 7267293 (Why is no real title available?)
- An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
- An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs
- A practicable branch and bound algorithm for sum of linear ratios problem
- scientific article; zbMATH DE number 6178192 (Why is no real title available?)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Branch-relaxation-bound algorithm for minimizing a class of sum of affine ratios programming problems
This page was built for publication: An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077941)
