در مورد بهینه سازی چند هدفه قوی و غیرمتعارف تحت محدوده ی عمومی با برنامه های کاربردی برای بهینه سازی نمونه کارها

We introduce a new concept of generalized convexity at a given point for a family of real-valued functions and deduce nonsmooth sufficient optimality conditions for robust (weakly) efficient solutions. In addition, we present a robust duality theory and Mond–Weir type duality for an uncertain multiobjective optimization problem. Furthermore, some nonsmooth saddle-point theorems are obtained under our generalized convexity assumption. Finally we show the viability of our new concept of generalized convexity for robust optimization and portfolio optimization.