Solving sum of quadratic ratios fractional programs via monotonic function

DOI10.1016/j.amc.2009.02.024zbMath1330.90111OpenAlexW2073038412MaRDI QIDQ1026289

Yuan Ma, Pei-Ping Shen, Yong-Qiang Chen

Publication date: 24 June 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.02.024

zbMATH Keywords

fractional programmingsum of ratiosnonisolated optimal solutionmonotonic optimizationbranch-reduce-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Related Items (10)

Maximizing for the sum of ratios of two convex functions over a convex set ⋮ Global optimization algorithm for sum of generalized polynomial 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 minimization for generalized polynomial fractional program ⋮ 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 ⋮ Solving the sum-of-ratios problems by a harmony search algorithm ⋮ Global optimization for the generalized polynomial sum of ratios problem ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Cites Work

• 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
• Global optimization of nonlinear sum of ratios problem
• On the global optimization of sums of linear fractional functions over a convex set
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Solving the sum-of-ratios problem by an interior-point method
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
• Global optimization for the sum of generalized polynomial fractional functions
• Global optimization for sum of linear ratios problem with coefficients
• Monotonic Optimization: Problems and Solution Approaches
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Fractional Programming. II, On Dinkelbach's Algorithm
• A note on the sum of a linear and linear-fractional function
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Programming with linear fractional functionals
• Monotonic Optimization: Branch and Cut Methods
• Cluster Analysis and Mathematical Programming
• Global optimization algorithm for the nonlinear sum of ratios problem

This page was built for publication: Solving sum of quadratic ratios fractional programs via monotonic function