In this article, we use the robust optimization approach (also called the worst-case approach) for finding e-efficient solutions of the robust multiobjective optimization problem defined as a robust (worst-case) counterpart for the considered nonsmooth multiobjective programming problem with the uncertainty in both the objective and constraint functions. Namely, we establish both necessary and sufficient optimality conditions for a feasible solution to be an e-efficient solution (an approximate efficient solution) of the considered robust multiobjective optimization problem. We also use a scalarizing method in proving these optimality conditions.

中文翻译：

---

非光滑鲁棒向量优化问题的近似效率

在本文中，我们使用鲁棒优化方法（也称为最坏情况方法）来寻找鲁棒多目标优化问题的 e 高效解，定义为所考虑的非光滑多目标规划问题的鲁棒（最坏情况）对应物目标函数和约束函数的不确定性。即，我们为可行解建立必要和充分的最优性条件，使其成为所考虑的鲁棒多目标优化问题的 e 有效解（近似有效解）。我们还使用标量方法来证明这些最优条件。