Search

In this paper, we consider a set optimization problem with a partial order relation, which is defined by Minkowski difference. By using the image space analysis, we establish the relationships among the set optimization problem, a vector optimization problem and a set-valued optimization with vector criterion related to the image of the set optimization problem. In addition, two nonlinear regular weak separation functions are proposed for the set optimization problem. Based on the two nonlinear regular weak separation functions, saddle point sufficient optimality conditions, gap functions and error bounds for the set optimization problem, are obtained. Finally, we explore some applications of the obtained results to investigate robust multi-objective optimization problems and verify the validity of the results in shortest path problems with data uncertainty and multi-criteria traffic network equilibrium problems with interval-valued cost functions. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept of second-order compound contingent epiderivative for set-valued maps and discuss its relationship to the second-order contingent epiderivative. Simultaneously, we also investigate some special properties of the second-order compound contingent epiderivative. By virtue of the second-order compound contingent epiderivative, we establish some unified second-order sufficient and necessary optimality conditions for set-valued optimization problems. All results in this paper generalize the corresponding results in the literature. [ABSTRACT FROM AUTHOR]