Interval-valued vector optimization problems involving gen-eralized approximate convexity

Interval-valued functions have been recently used to accommodate data inexactness in optimization and decision theory. In this paper, we consider the case of interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate efficient solutions.