Abstract:

By introducing a class of optimization problems with uncertainty information both in the objective functions and constraints, and then using the robusttype subdifferential constraint qualification, we characterized MondWeir type robust duality between the uncertain optimization problem and its uncertain dual problem, in other words, the duality between the robust counterpart of the primal problem and the optimistic counterpart of its dual problem.

Key words: uncertain optimization problem, robust duality, constraint qualification