LU-Efficient Solutions for Interval-Valued Nonsmooth Vector Optimization Problem

In this paper, we investigate a type of optimization problem called interval-valued vector optimization problems (IVOP). We establish their connections with two types of interval vector variational inequalities (IVVI) called the Stampacchia and Minty kinds. We also explore the solution to IVOP under the LU-convexity assumption. Additionally, we investigate the weak version of the IVVI of the Minty and Stampacchia kinds and establish relationships between them and the weakly LU-efficient solution of the IVOP. To validate our results, we present a numerical illustration. Our study enhances and generalizes certain earlier results found in existing literature.