First and Second-Order Optimality Condition for Multi-Objective Fraction Programming

Abstract

We consider nonsmooth multiobjective fractional programming on normed spaces. Using first- and second-order approximations as generalized derivatives, first- and second-order optimality conditions are established. Unlike the existing results, we avoid completely convexity assumptions. Our results can be applied even in infinite-dimensional cases, involving non-Lipschitz maps.