Fully piecewise linear vector optimization problem

We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed spaces. Based on such a representation, we study a fully piecewise linear vector optimization (PLP) with the objective and constraint functions being piecewise linear. We divide (PLP) into some linear subproblems and structure a finite dimensional reduction method to solve (PLP). Under some mild assumptions, we prove that the Pareto (resp. weak Pareto) solution set of (PLP) is the union of finitely many generalized polyhedra (resp. polyhedra), each of which is contained in a Pareto (resp. weak Pareto) face of some linear subproblem. Our main results are even new in the linear case and further generalize Arrow, Barankin and Blackwell's classical results on linear vector optimization problems in the framework of finite dimensional spaces.

[1]  Paul Armand,et al.  Finding all maximal efficient faces in multiobjective linear programming , 1993, Math. Program..

[2]  Nguyen Ngoc Luan.  Piecewise Linear Vector Optimization Problems on Locally Convex Hausdorff Topological Vector Spaces , 2017, 1705.06893.

[3]  Xiaoqi Yang,et al.  The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces , 2008 .

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

[5]  Jen-Chih Yao,et al.  On Some Generalized Polyhedral Convex Constructions , 2017, 1705.06892.

[6]  Stefan Nickel,et al.  Multiple objective programming with piecewise linear functions , 1999 .

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

[8]  Amelia Bilbao-Terol,et al.  Management of surgical waiting lists through a Possibilistic Linear Multiobjective Programming problem , 2005, Appl. Math. Comput..

[9]  Hyunjoong Kim,et al.  Functional Analysis I , 2017 .

[10]  Xi Yin Zheng.  Pareto Solutions of Polyhedral-valued Vector Optimization Problems in Banach Spaces , 2009 .

[11]  Note on Prime Representations of Convex Polyhedral Sets , 2004 .

[12]  D. Luc,et al.  On Sensitivity in Linear Multiobjective Programming , 2000 .

[13]  Stanley Zionts,et al.  Redundancy in Mathematical Programming , 1983 .

[14]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[15]  Margarita M. L. Rodriguez,et al.  Even Convexity and Optimization , 2020 .

[16]  Xiaoqi Yang,et al.  Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization , 2012, Oper. Res..

[17]  D. Chand,et al.  On Convex Polyhedra , 1970 .

[18]  J. Telgen.  Minimal representation of convex polyhedral sets , 1982 .

[19]  X. Q. Yang,et al.  Structure and Weak Sharp Minimum of the Pareto Solution Set for Piecewise Linear Multiobjective Optimization , 2010, J. Optim. Theory Appl..

[20]  S. Vajda,et al.  Contribution to the Theory of Games , 1951 .

[21]  H. P. Benson,et al.  Outcome Space Partition of the Weight Set in Multiobjective Linear Programming , 2000 .

[22]  D. Blackwell,et al.  5. Admissible Points of Convex Sets , 1953 .

[23]  Klaudia Beich,et al.  Theory Of Vector Optimization , 2016 .