A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
The proposed algorithm computes the lower bounds required during the branch and bound search by solving linear programming problems. These problems are derived by using Lagrangian weak duality theorem of nonlinear programming. The feasibility and efficiency of the proposed algorithm is shown by computational results for a set of randomly generated test problems. It is pointed out that the algorithm applies to a broad class of convex-convex ratio problems, and furthermore, the primary work of the algorithm involves the solution of ordinary linear programming problems that do not grow in size from iteration to iteration.
- On the global optimization for a class of sum of convex-convex ratios problem
- Global optimization for the sum of concave-convex ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- On a duality bound method for a class of nonlinear sum of ratios problem
- Global optimization for the problem of sum of convex ratios over nonconvex feasible region
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Convex analysis and global optimization
- Fractional programming with convex quadratic forms and functions
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for sum of linear ratios problem with coefficients
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 1445369 (Why is no real title available?)
- Introduction to global optimization
- Maximization of the ratio of two convex quadratic functions over a polytope
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- Maximizing the ratio of two convex functions over a convex set
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- A parametric solution method for a generalized fractional programming problem
- Global optimization for the sum of concave-convex ratios problem
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- Optimising portfolio diversification and dimensionality
- A practicable branch and bound algorithm for sum of linear ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- Global optimization algorithm for sum of generalized polynomial ratios problem
- On the global optimization for a class of sum of convex-convex ratios problem
- On a duality bound method for a class of nonlinear sum of ratios problem
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- scientific article; zbMATH DE number 2190131 (Why is no real title available?)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
This page was built for publication: A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953379)
