Optimality conditions and duality in multiobjective programming with invexity
Open Access
- 1 January 2008
- journal article
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 18 (2) , 153-165
Abstract
(', ?)-invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical duality properties.Keywords
This publication has 10 references indexed in Scilit:
- Some results on symmetric duality of multiobjective programmes with generalized (F,ρ) invexityEuropean Journal of Operational Research, 2006
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functionsJournal of Mathematical Analysis and Applications, 2004
- Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming ProblemsJournal of Global Optimization, 2003
- Non-differentiable second order symmetric duality in mathematical programming with F-convexityEuropean Journal of Operational Research, 2003
- Second order symmetric duality in mathematical programming with F-convexityEuropean Journal of Operational Research, 2000
- On efficiency and duality for multiobjective programsJournal of Mathematical Analysis and Applications, 1992
- Generalised convexity and duality in multiple objective programmingBulletin of the Australian Mathematical Society, 1989
- The essence of invexityJournal of Optimization Theory and Applications, 1985
- Strong and Weak Convexity of Sets and FunctionsMathematics of Operations Research, 1983
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981