%0 Journal Article
%T On optimality and duality for multiobjective interval-valued programming problems with vanishing constraints
%J Iranian Journal of Numerical Analysis and Optimization
%I Ferdowsi University of Mashhad
%Z 2423-6977
%A Japamala Rani, B.
%A Ahmad, I.
%A Kummari, K.
%D 2023
%\ 09/01/2023
%V 13
%N 3
%P 354-384
%! On optimality and duality for multiobjective interval-valued programming problems with vanishing constraints
%K Multiobjective interval-valued optimization problem
%K vanishing constraints
%K (weakly) LU-efficient solution
%K Duality
%R 10.22067/ijnao.2023.76095.1127
%X 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.
%U https://ijnao.um.ac.ir/article_43541_30688d7964a3110f285870ab2919555f.pdf