Optimality conditions for multiobjective fractional programming, via convexificators

Abstract

In this paper, the idea of convexificators is used to derive the Karush-Kuhn-Tucker necessary optimality conditions for local weak efficient solutions of multiobjective fractional problems involving inequality and equality constraints. In this regard, several well known constraint qualifications are generalized and relationships between them are investigated. Moreover, some examples are provided to clarify our results. © 2018, Journal of Industrial and Management Optimization.