Lower subdifferentiability in minimax fractional programming*
C. Bajona-Xandri, Juan Enrique Martínez-Legaz · Optimization · 1999
Minimax fractional programming problems are analyzed from the view- point of lower subdifferentiability, obtaining Kuhn-Tucker type optimality conditions. Multiobjective optimization problems with fractional objectives are also studied.