Abstract

Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space. This article extends the geometric duality theory to convex vector optimization problems.

Author information

Contact details are reproduced from the original publication and may be historical.

Keywords

  • Geometric duality theory
  • vector optimization
  • Legendre-Fenchel conjugate
  • second-order subdifferential
  • Dupin indicatrix

Mathematics Subject Classification

52A41, 52A20, 90C46, 90C29

Suggested citation

F. Heyde. “Geometric Duality for Convex Vector Optimization Problems.” Journal of Convex Analysis 20 (2013), No. 3, 813–832.

Copyright Heldermann Verlag 2013