Pages that link to "Item:Q336507"
From MaRDI portal
The following pages link to Maximizing for the sum of ratios of two convex functions over a convex set (Q336507):
Displaying 15 items.
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
- Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region (Q2511139) (← links)
- Optimising portfolio diversification and dimensionality (Q2679246) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem (Q5244299) (← links)
- (Q5250493) (← links)
- Maximizing the ratio of two convex functions over a convex set (Q5438529) (← links)
- A potential practical algorithm for minimizing the sum of affine fractional functions (Q6106325) (← links)
