Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios

DOI10.1007/s10957-005-4717-zzbMath1129.90053OpenAlexW2079937712MaRDI QIDQ852112

N. E. Zubov

Publication date: 27 November 2006

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

Full work available at URL: https://doi.org/10.1007/s10957-005-4717-z

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (9)

A new branch and bound algorithm for minimax ratios problems ⋮ Farkas-type results for fractional programming problems ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ A new linearization technique for minimax linear fractional programming ⋮ Interval division and linearization algorithm for minimax linear fractional program ⋮ Robust fractional programming ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ Generic algorithm for generalized fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Solving continuous min-max problems by an iterative entropic regularization method.
• An algorithm for generalized fractional programs
• A note on an algorithm for generalized fractional programs
• Algorithms for generalized fractional programming
• Solving min-max problems and linear semi-infinite programs
• Generalized fractional programming and cutting plane algorithms
• Duality in generalized linear fractional programming
• A Fast Algorithm for a Class of Generalized Fractional Programs
• Penalty and Barrier Methods: A Unified Framework
• A combined algorithm for fractional programming

This page was built for publication: Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios