Optimality and duality for nonsmooth multiobjective programming using G-type I functions
From MaRDI portal
Publication:279181
DOI10.1016/j.amc.2014.04.066zbMath1334.90155OpenAlexW1965078279MaRDI QIDQ279181
Rekha Gupta, Manjari K. Srivastava
Publication date: 27 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.04.066
dualitymultiobjective programmingnecessary and sufficient optimality conditionslocally Lipschitz functionsgeneralized G-type I functions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
- On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \(V-r\)-invex functions
- The essence of invexity
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Some nondifferentiable multiobjective programming under generalized d-V-type-I univexity
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Optimality and duality theorems for non smooth multiobjective fractional programs
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
- Optimality and duality with generalized convexity
- On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
- Optimality conditions of the \(G\)-type in locally Lipschitz multiobjective programming
- Optimization and nonsmooth analysis
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
This page was built for publication: Optimality and duality for nonsmooth multiobjective programming using G-type I functions
