arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.1708math.OC
收藏

多面锥投影与线性向量最优化

Projection of polyhedral cones and linear vector optimization

Andreas Löhne

摘要:

考虑由有限个线性不等式给出的多面体凸锥。我们调查的问题,这个锥投影到一个子空间,并表明这个问题是密切相关的线性向量最优化:我们定义了一个锥投影问题,使用的数据,一个给定的线性向量最优化问题,并考虑这个问题,以确定端方向和基础的线性空间的投影锥$K$。该问题的结果产生线性向量最优化问题的解。类似地,对偶锥投影问题与$K$的极锥相关:得到几何对偶线性向量最优化问题的解。我们勾勒出的想法,由此产生的算法解决任意线性向量最优化问题,并提供了另一种证明的几何对偶定理的基础上的对偶多面体。

英文摘要:

Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We define a cone projection problem using the data of a given linear vector optimization problem and consider the problem to determine the extreme directions and a basis of the lineality space of the projected cone $K$. The result of this problem yields a solution of the linear vector optimization problem. Analogously, the dual cone projection problem is related to the polar cone of $K$: One obtains a solution of the geometric dual linear vector optimization problem. We sketch the idea of a resulting algorithm for solving arbitrary linear vector optimization problems and provide an alternative proof of the geometric duality theorem based on duality of polytopes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑