完全分段线性向量最优化问题
Fully piecewise linear vector optimization problem
摘要:
我们区分了两类分段线性函数,并为两个赋范空间之间的分段线性函数提供了一个有趣的表示。在此基础上,研究了目标函数和约束函数均为分段线性的完全分段线性向量最优化问题。我们将(PLP)分解为若干线性子问题,构造了一个有限维降阶方法来求解(PLP)。在一些温和的假设下,我们证明了帕累托(resp。(PLP)的弱Pareto解集是两个广义多面体的并(分别为每个人都有一个属于自己的世界,弱Pareto)面。我们的主要结果在线性情形下是新的,并且进一步推广了Arrow,Barankin和Blackwell在有限维空间框架下关于线性向量最优化问题的经典结果.
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。