Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity
From MaRDI portal
Publication:262553
DOI10.1186/s13660-015-0819-9zbMath1343.90082OpenAlexW1827173559WikidataQ59428778 ScholiaQ59428778MaRDI QIDQ262553
Suliman Al-Homidan, Izhar Ahmad
Publication date: 30 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0819-9
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Optimality and duality theorems in nonsmooth multiobjective optimization
- Strict global minimizers and higher-order generalized strong invexity in multiobjective optimization
- Optimality and duality in nonsmooth multiobjective optimization involving V-type I invex functions
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- First and second order sufficient conditions for strict minimality in nonsmooth vector optimization.
- Optimality and duality for nonsmooth multiobjective optimization problems
- Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
- Optimality and mixed saddle point criteria in multiobjective optimization
- FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING
- Stability in Mathematical Programming with Nondifferentiable Data
- Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems
- Optimization and nonsmooth analysis
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Non differentiable symmetric duality
- Strict efficiency in vector optimization
This page was built for publication: Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity