Minimization of isotonic functions composed of Fractions

DOI10.1007/s10957-010-9684-3zbMath1229.90223OpenAlexW2067858018MaRDI QIDQ613584

Sumit K. Garg

Publication date: 21 December 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9684-3

zbMATH Keywords

cutting plane methodDinkelbach-type algorithmgeneralized fractional programmingisotonic functionmin-max fractional programmingsum-of-ratios minimization problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Fractional programming (90C32)

Cites Work

• 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
• An algorithm for generalized fractional programs
• A note on an algorithm for generalized fractional programs
• Solving the sum-of-ratios problem by an interior-point method
• Generalized fractional programming and cutting plane algorithms
• A new algorithm for generalized fractional programs
• A solvability theorem and minimax fractional programming
• Parametric approaches to fractional programs
• Penalty and Barrier Methods: A Unified Framework
• On Nonlinear Fractional Programming
• A Class of Fractional Programming Problems
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• Global optimization of nonlinear sums of ratios
• Global optimization algorithm for the nonlinear sum of ratios problem
• Unnamed Item

This page was built for publication: Minimization of isotonic functions composed of Fractions