Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem

Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential

“…To raise this drawbacks, many contributions have been focused on the characterizations of sequential optimality condition for a vector convex problem or a fractional optimization problem which avoid a constraint qualification (see [4-7, 10, 14, 15]). The recent contributions of Moustaid-Laghdir-Dali-Rikouane in [9,11] motivate the present work where the sequential optimality conditions are stated, via sequential subdifferential calculus, in terms of limits of sequences in approximate subdifferential or in exact subdifferential at neabry points. So, the purpose of this paper is to establish sequential optimality conditions for a fractional optimization problem without any constraint qualifications characterizing completely a Henig efficient solution.…”