Necessary optimality conditions for a fractional multiobjective optimization problem
نویسندگان
چکیده
In this paper, we are concerned with a fractional multiobjective optimization problem ( P ). Using support functions together generalized Guignard constraint qualification, give necessary optimality conditions in terms of convexificators and the Karush–Kuhn–Tucker multipliers. Several intermediate problems have been introduced to help us our investigation.
منابع مشابه
Necessary Optimality Conditions for Multiobjective Bilevel Programs
The multiobjective bilevel program is a sequence of two optimization problems, with the upper-level problem being multiobjective and the constraint region of the upper level problem being determined implicitly by the solution set to the lower-level problem. In the case where the Karush-Kuhn-Tucker (KKT) condition is necessary and sufficient for global optimality of all lower-level problems near...
متن کاملOptimality criteria for sum of fractional multiobjective optimization problem with generalized invexity
The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development ...
متن کاملSufficient Second Order Optimality Conditions for C Multiobjective Optimization Problems
In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C, but not necessarily of class C.
متن کاملOptimality Conditions for Approximate Solutions in Multiobjective Optimization Problems
We study firstand second-order necessary and sufficient optimality conditions for approximate weakly, properly efficient solutions of multiobjective optimization problems. Here, tangent cone, -normal cone, cones of feasible directions, second-order tangent set, asymptotic second-order cone, and Hadamard upper lower directional derivatives are used in the characterizations. The results are first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2020049