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

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.