Using conical partition to globally maximizing the nonlinear sum of ratios

DOI10.1016/j.apm.2009.11.006zbMath1195.90086OpenAlexW2018728006MaRDI QIDQ1957316

Li Jin, Pei-Ping Shen

Publication date: 25 September 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2009.11.006

zbMATH Keywords

global optimizationbranch-and-boundconcave envelopesum of ratiosbounding tightening strategy

Mathematics Subject Classification ID

Convex programming (90C25) Fractional programming (90C32)

Related Items (10)

A practicable branch and bound algorithm for sum of linear ratios problem ⋮ 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 optimization for a class of nonlinear sum of ratios problem ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ 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 parametric solution method for a generalized fractional programming problem ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Cites Work

• 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
• Global optimization of generalized linear fractional programming with nonlinear constraints
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A new accelerating method for globally solving a class of nonconvex programming problems
• Global optimization of signomial geometric programming using linear relaxation.
• 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
• A note on the paper ``Global optimization of nonlinear sum of ratios
• Global optimization for sum of linear ratios problem with coefficients
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Global optimization algorithm for the nonlinear sum of ratios problem

This page was built for publication: Using conical partition to globally maximizing the nonlinear sum of ratios