On optimality and duality for multiobjective interval-valued programming problems with vanishing constraints

Iranian Journal of Numerical Analysis and Optimization

مقاله 1، دوره 13، شماره 3 - شماره پیاپی 26، آذر 2023، صفحه 354-384   

نوع مقاله: Research Article

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

نویسندگان

B. Japamala Rani^{* 1}؛ I. Ahmad²؛ K. Kummari¹

¹Department of Mathematics, School of Science, GITAM-Hyderabad Campus, Hyderabad-502329, India.

²Department of Mathematics, King Fahd University of Petroleum and Minerals, Dhahran-31261, Saudi Arabia.

چکیده

In this study, we explore the theoretical features of a multiobjective interval-valued programming problem with vanishing constraints. In view of this, we have defined a multiobjective interval-valued programming prob-lem with vanishing constraints in which the objective functions are consid-ered to be interval-valued functions, and we define an LU-efficient solution by employing partial ordering relations. Under the assumption of general-ized convexity, we investigate the optimality conditions for a (weakly) LU-efficient solution to a multiobjective interval-valued programming problem with vanishing constraints. Furthermore, we establish Wolfe and Mond–Weir duality results under appropriate convexity hypotheses. The study concludes with examples designed to validate our findings.

کلیدواژه‌ها

Multiobjective interval-valued optimization problem؛ vanishing constraints؛ (weakly) LU-efficient solution؛ duality

مراجع