On sufficiency and duality for a class of interval-valued programming problems

In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond–Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs.