Geometric Duality for Convex Vector Optimization Problems
From MaRDI portal
Publication:2850733
zbMath1301.90083arXiv1109.3592MaRDI QIDQ2850733
Publication date: 30 September 2013
Full work available at URL: https://arxiv.org/abs/1109.3592
vector optimization; second-order subdifferential; Legendre-Fenchel conjugate; Dupin indicatrix; geometric duality theory
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
52A41: Convex functions and convex programs in convex geometry
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems, Algorithms to Solve Unbounded Convex Vector Optimization Problems, Primal and dual approximation algorithms for convex vector optimization problems, Benson type algorithms for linear vector optimization and applications, Tractability of convex vector optimization problems in the sense of polyhedral approximations, Set Optimization—A Rather Short Introduction, Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs
Uses Software