Approximate convexity in vector optimisation

Anjana Rani Gupta, Aparna Mehra, Davinder Bhatia · Bulletin of the Australian Mathematical Society · 2006

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.

Read the paper · More papers on PaperTik