An algorithm to solve polyhedral convex set optimization problems

An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain satisfying two conditions: the attainment of the infimum and minimality with respect to a set relation. In the first phase of the algorithm, a linear vector optimization problem, called the vectorial relaxation, is solved. The resulting pre-solution yields the attainment of the infimum but, in general, not minimality. In the second phase of the algorithm, minimality is established by solving certain linear programs in combination with vertex enumeration of some values of the objective map.

[1]  Lizhen Shao,et al.  Approximating the nondominated set of an MOLP by approximately solving its dual problem , 2008, Math. Methods Oper. Res..

[2]  Lizhen Shao,et al.  Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning , 2008, Math. Methods Oper. Res..

[3]  A. Hamel,et al.  Directional derivatives and subdifferentials of set-valued convex functions , 2012, 1207.5295.

[4]  Andreas H. Hamel,et al.  Set-valued average value at risk and its computation , 2012 .

[5]  Andreas H. Hamel,et al.  A Duality Theory for Set-Valued Functions I: Fenchel Conjugation Theory , 2009 .

[6]  H. Riahi,et al.  Variational Methods in Partially Ordered Spaces , 2003 .

[7]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[8]  Johannes Jahn,et al.  Vector optimization - theory, applications, and extensions , 2004 .

[9]  A. Hamel,et al.  Risk minimization and set-valued average value at risk via linear vector optimization , 2012 .

[10]  Lizhen Shao,et al.  A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming , 2012, J. Glob. Optim..

[11]  Andreas H. Hamel,et al.  Duality for Set-Valued Measures of Risk , 2010, SIAM J. Financial Math..

[12]  H. P. Benson,et al.  Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming , 1998 .

[13]  A. Hamel,et al.  Variational principles on metric and uniform spaces , 2005 .

[14]  Andreas Löhne,et al.  Solution concepts in vector optimization: a fresh look at an old story , 2011 .

[15]  Andreas Löhne,et al.  Vector Optimization with Infimum and Supremum , 2011, Vector Optimization.

[16]  Christiane Tammer,et al.  A new approach to duality in vector optimization , 2007 .

[17]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

[18]  Andreas H. Hamel,et al.  Set-valued risk measures for conical market models , 2010, 1011.5986.

[19]  Johannes Jahn,et al.  Duality in vector optimization , 1983, Math. Program..

[20]  Miguel Sama,et al.  On solutions of set-valued optimization problems , 2010, Comput. Math. Appl..

[21]  Andreas H. Hamel,et al.  Lagrange Duality in Set Optimization , 2014, J. Optim. Theory Appl..

[22]  Johannes Jahn,et al.  New Order Relations in Set Optimization , 2011, J. Optim. Theory Appl..

[23]  David Bremner,et al.  Primal—Dual Methods for Vertex and Facet Enumeration , 1998, Discret. Comput. Geom..