Maximizing for the sum of ratios of two convex functions over a convex set
From MaRDI portal
Publication:336507
DOI10.1016/j.cor.2013.03.012zbMath1348.90578OpenAlexW2062303963MaRDI QIDQ336507
Xiaodi Bai, Weimin Li, Pei-Ping Shen
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.012
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Related Items (7)
Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm ⋮ Optimising portfolio diversification and dimensionality ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Practical global optimization for multiview geometry
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Solving sum of quadratic ratios fractional programs via monotonic function
- Fractional programming: Applications and algorithms
- Solving the sum-of-ratios problem by an interior-point method
- Conical partition algorithm for maximizing the sum of dc ratios
- A global optimization algorithm for linear fractional and bilinear programs
- Introduction to global optimization
- Global optimization for the sum of generalized polynomial fractional functions
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of linear ratios problem with coefficients
- Fractional programming with convex quadratic forms and functions
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Maximizing the ratio of two convex functions over a convex set
- Maximization of the ratio of two convex quadratic functions over a polytope
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: Maximizing for the sum of ratios of two convex functions over a convex set
