Higher order duality in vector optimization over cones

Higher order duality in vector optimization over cones

0.00 Avg rating0 Votes
Article ID: iaor2012322
Volume: 6
Issue: 1
Start Page Number: 17
End Page Number: 30
Publication Date: Jan 2012
Journal: Optimization Letters
Authors:
Keywords: programming: convex
Abstract:

In this paper higher order cone convex, pseudo convex, strongly pseudo convex, and quasiconvex functions are introduced. Higher order sufficient optimality conditions are given for a weak minimum, minimum, strong minimum and Benson proper minimum solution of a vector optimization problem. A higher order dual is associated and weak and strong duality results are established under these new generalized convexity assumptions.

Reviews

Required fields are marked *. Your email address will not be published.