Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem

Iranian Journal of Numerical Analysis and Optimization

مقاله 11، دوره 15، Issue 2 - شماره پیاپی 33، تابستان 2025، صفحه 676-703   

نوع مقاله: Research Article

شناسه دیجیتال (DOI): 10.22067/ijnao.2025.90229.1534

نویسندگان

A. Ed-dahdah^* ؛ M. Laghdir؛ M. Echchaabaoui؛ M. Mabrouk

Department of Mathematics, Faculty of Sciences, University of Chouaib Doukkali, El jadida, Morocco.

چکیده

The aim of this paper is to establish sequential necessary and sufficient approximate optimality conditions for a constrained convex vector mini-mization problem without any constraint qualifications, characterizing the approximate proper and weak efficient solutions. The constraints are de-scribed by mappings taking values in different preorder vector spaces. Our approach is based essentially on the sequential approximate subdifferential calculus rule for the sums of a finite family of cone convex mappings. To illustrate our main result, an application to multiobjective fractional pro-gramming problem is given. Finally, we present an important subclass of such problems showing the applicability of the obtained conditions.

کلیدواژه‌ها

Vector optimization؛ Approximate Pareto subdifferential of con-vex mappings؛ Sequential approximate optimality conditions

مراجع