Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T07:24:51.646Z Has data issue: false hasContentIssue false

Approximate convexity in vector optimisation

Published online by Cambridge University Press:  17 April 2009

Anjana Gupta
Affiliation:
Department of Operational Research, University of Delhi, Delhi-110007, India e-mail: anjanagupta2006@rediffmail.com
Aparna Mehra
Affiliation:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi 110016, India e-mail: apmehra@maths.iitd.ac.in
Davinder Bhatia
Affiliation:
Department of Operational Research, University of Delhi, Delhi 110007, India
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2006