Approximate convexity in vector optimisation
- 1 October 2006
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 74 (2) , 207-218
Abstract
Approximate convex functions are characterised in terms of Clarke generalised gradient. We apply this characterisation to derive optimality conditions for quasi efficient solutions of nonsmooth vector optimisation problems. Two new classes of generalised approximate convex functions are defined and mixed duality results are obtained.Keywords
This publication has 9 references indexed in Scilit:
- On Mixed Duality in Mathematical ProgrammingJournal of Mathematical Analysis and Applications, 2001
- On Incomplete Lagrange Function and Saddle Point Optimality Criteria in Mathematical ProgrammingJournal of Mathematical Analysis and Applications, 2000
- Mixed Type Duality in Multiobjective Programming ProblemsJournal of Mathematical Analysis and Applications, 1996
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programsOptimization, 1994
- On generalised convex mathematical programmingThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1992
- On efficiency and duality for multiobjective programsJournal of Mathematical Analysis and Applications, 1992
- Efficiency and generalized convex duality for multiobjective programsJournal of Mathematical Analysis and Applications, 1989
- Strong and Weak Convexity of Sets and FunctionsMathematics of Operations Research, 1983
- Further Generalizations of Convexity in Mathematical ProgrammingJournal of Information and Optimization Sciences, 1982