Lower subdifferentiability in minimax fractional programming *
Abstract:
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.