Global optimization for a class of nonlinear sum of ratios problem
Summary: We present a branch and bound algorithm for globally solving the sum of ratios problem. In this problem, each term in the objective function is a ratio of two functions which are the sums of the absolute values of affine functions with coefficients. This problem has an important application in financial optimization, but the global optimization algorithm for this problem is still rare in the literature so far. In the algorithm we presented, the branch and bound search undertaken by the algorithm uses rectangular partitioning and takes place in a space which typically has a much smaller dimension than the space to which the decision variables of this problem belong. Convergence of the algorithm is shown. At last, some numerical examples are given to vindicate our conclusions.
- Global optimization of nonlinear sum of ratios problem
- Global optimization for a class of sum of ratios problems
- scientific article; zbMATH DE number 5631536
- Global optimization of nonlinear sums of ratios
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization algorithm for a class of sum of linear ratios problem
- Global optimization for the problem of sum of convex ratios over nonconvex feasible region
- Global optimization for the sum of concave-convex ratios problem
- On the global optimization for a class of sum of convex-convex ratios problem
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A note on the paper ``Global optimization of nonlinear sum of ratios
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- An efficient algorithm for solving convex-convex quadratic fractional programs
- 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
- Conical partition algorithm for maximizing the sum of dc ratios
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- On some geometric optimization problems in layered manufacturing
- Optimization on low rank nonconvex structures
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- Minimization of the ratio of functions defined as sums of the absolute values
- Global optimization for sum of linear ratios problem with coefficients
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- scientific article; zbMATH DE number 5120881 (Why is no real title available?)
- scientific article; zbMATH DE number 5631536 (Why is no real title available?)
- scientific article; zbMATH DE number 6130268 (Why is no real title available?)
- Global optimization of nonlinear sums of ratios
- Global optimization algorithm for the nonlinear sum of ratios problem
- A branch-and-cut algorithm for a class of sum-of-ratios problems
This page was built for publication: Global optimization for a class of nonlinear sum of ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717663)
