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

مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 22 دی 1403

نوع مقاله: Research Article

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

نویسندگان

Ahmed Ed-Dahdah^* ؛ Mohamed Laghdir؛ El Mahjoub Echchaabaoui؛ M'hamed Mabrouk

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

چکیده

The aim of this paper of is to establish sequential necessary and sufficient approximate optimality conditions for a constrained convex vector minimization problem without any constraint qualifications, characterizing the approximate proper and weak efficient solutions. The constraints are described 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 a multiobjective fractional programming problem is given. Finally, we present an important sub-class of such problems showing the applicability of the obtained conditions.

کلیدواژه‌ها

Vector optimization؛ Approximate Pareto subdifferential of convex mappings؛ Sequential approximate optimality conditions