Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints

In this paper, we consider an uncertain convex optimization problem with a robust convex feasible set described by locally Lipschitz constraints. Using robust optimization approach, we give some new characterizations of robust solution sets of the problem. Such characterizations are expressed in terms of convex subdifferentails, Clarke subdifferentials, and Lagrange multipliers. In order to characterize the solution set, we first introduce the so-called pseudo Lagrangian function and establish constant pseudo Lagrangian-type property for the robust solution set. We then used to derive Lagrange multiplier-based characterizations of robust solution set. By means of linear scalarization, the results are applied to derive characterizations of weakly and properly robust efficient solution sets of convex multi-objective optimization problems with data uncertainty. Some examples are given to illustrate the significance of the results.