Optimality conditions and duality for interval-valued optimization problems using convexifactors

摘要

This paper is devoted to the applications of convexifactors on interval-valued programming problem. Based on the concept of LU optimal solution, sufficient optimality conditions are established under generalized ??-convexity assumptions. Furthermore, appropriate duality theorems are derived for two types of dual problem, namely Mond-Weir and Wolfe type duals. We also construct examples to manifest the established relations.