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

线性向量最优化的Benson型算法及其应用

Benson type algorithms for linear vector optimization and applications

Andreas H. Hamel, Andreas Löhne, Birgit Rudloff

摘要:

本文给出了求解线性向量最优化问题的Benson外逼近算法的新形式和扩展。原始和对偶变量中,只有一个标量线性规划必须解决在每次迭代,而不是两个或三个在以前的版本。推广到任意尖的立体多面体序锥的问题。数值例子提供,其中之一涉及一个新的集值风险度量的多变量的立场。

英文摘要:

New versions and extensions of Benson's outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each iteration rather than two or three as in previous versions. Extensions are given to problems with arbitrary pointed solid polyhedral ordering cones. Numerical examples are provided, one of them involving a new set-valued risk measure for multivariate positions.

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

↑