Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
Summary: We consider a nonsmooth multiobjective programming problem where the functions involved are nondifferentiable. The class of univex functions is generalized to a far wider class of \((\varphi, \alpha, \rho, \sigma)\)-\(d_I\)-\(V\)-type I univex functions. Then, through various nontrivial examples, we illustrate that the class introduced is new and extends several known classes existing in the literature. Based upon these generalized functions, Karush-Kuhn-Tucker type sufficient optimality conditions are established. Further, we derive weak, strong, converse, and strict converse duality theorems for Mond-Weir type multiobjective dual program.
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
- Nonsmooth multiobjective optimization involving generalized univex functions
- Generalized univex functions in nonsmooth multiobjective optimization
- On nonsmooth multiobjective programming with generalized univexity
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
- \(D\)-invexity and optimality conditions
- A class of nonconvex functions and mathematical programming
- scientific article; zbMATH DE number 592621 (Why is no real title available?)
- scientific article; zbMATH DE number 746083 (Why is no real title available?)
- Multiobjective programming under d-invexity
- Multiobjective programming under generalized type I invexity
- Necessary and sufficient conditions in constrained optimization
- Nondifferentiable multiobjective programming under generalized d-univexity
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
- Nonsmooth multiobjective optimization involving generalized univex functions
- On generalised convex mathematical programming
- On multiple-objective optimization with generalized univexity
- On sufficiency of the Kuhn-Tucker conditions
- Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
- Optimality and duality with generalized convexity
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Optimization and nonsmooth analysis
- Pre-invex functions in multiple objective optimization
- Some nondifferentiable multiobjective programming problems
- Strong and Weak Convexity of Sets and Functions
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Nonsmooth multiobjective optimization involving generalized univex functions
- Efficiency and duality in nonsmooth multiobjective programming with (F,,,)-d-V-univexity
- scientific article; zbMATH DE number 6019694 (Why is no real title available?)
- Generalized univex functions in nonsmooth multiobjective optimization
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
- On nonsmooth multiobjective programming with generalized univexity
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
This page was built for publication: Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q469982)
