Optimality conditions for a nonsmooth uncertain multiobjective programming problem
Summary: This note is devoted to the investigation of optimality conditions for robust approximate quasi weak efficient solutions to a \textit{nonsmooth uncertain multiobjective programming} problem (NUMP). Firstly, under the extended nonsmooth Mangasarian-Fromovitz constrained qualification assumption, the optimality necessary conditions of robust approximate quasi weak efficient solutions are given by using an alternative theorem. Secondly, a class of generalized convex functions is introduced to the problem (NUMP), which is called the pseudoquasi-type-I function, and its existence is illustrated by a concrete example. Finally, under the pseudopseudo-type-I generalized convexity hypothesis, the optimality sufficient conditions for robust approximate quasi weak efficient solutions to the problem (NUMP) are established.
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions of the approximate quasi-weak robust efficiency for uncertain multi-objective convex optimization
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- A class of nonsmooth fractional multiobjective optimization problems
- Characterizations of robust solution for convex optimization problems with data uncertainty
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- Optimization and nonsmooth analysis
- Robust optimization
- Relations among efficient solutions in uncertain multiobjective programming
- Perturbed cones for analysis of uncertain multi-criteria optimization problems
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Optimality conditions and saddle point theorems of approximate quasi weak efficient solutions for robust multi-objective programming
- On optimality conditions for robust weak sharp solution in uncertain optimizations
- Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability
- Sufficient Optimality Conditions for a Robust Multiobjective Problem
- Optimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programming
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- \(\chi\)-optimal solution of single objective nonlinear optimization problem with uncertain parameters
This page was built for publication: Optimality conditions for a nonsmooth uncertain multiobjective programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2205325)
