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

线性向量最优化问题的参数单纯形算法

A Parametric Simplex Algorithm for Linear Vector Optimization Problems

Birgit Rudloff, Firdevs Ulus, Robert Vanderbei

摘要:

提出了一种求解线性向量最优化问题的参数单纯形算法。该算法可以被视为多目标单纯形(Evans-Steuer)算法的变体[12]。与之不同的是,该算法是在参数空间中工作的,并不以寻找所有有效解的集合为目标。相反,它找到了Loehne [16]意义上的解,也就是说,它找到了允许生成整个边界的有效解的子集。从这个意义上说,它也可以被看作是参数自对偶单纯形算法的推广,该算法最初是为解决单目标线性最优化问题而设计的,并被修改为解决Ruszczynski和Vanderbei [21]中的两个目标有界LVOP,其中正正交作为排序锥。本文提出的算法适用于任意维数、任意实心尖多面体序锥C以及有界和无界问题。提供了数值结果,以比较所提出的算法与基于目标空间的LVOP算法([13]中的Benson算法),该算法也提供了[16]意义上的解决方案,以及Evans-Steuer算法[12]。结果表明,对于非退化问题,该算法优于Benson算法,与Evan-Steuer算法相当。对于高度退化的问题,Benson算法[13]优于单纯形算法;然而,参数单纯形算法在计算上比Evans-Steuer算法更有效。

英文摘要:

In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Loehne [16], that is, it finds a subset of efficient solutions that allows to generate the whole frontier. In that sense, it can also be seen as a generalization of the parametric self-dual simplex algorithm, which originally is designed for solving single objective linear optimization problems, and is modified to solve two objective bounded LVOPs with the positive orthant as the ordering cone in Ruszczynski and Vanderbei [21]. The algorithm proposed here works for any dimension, any solid pointed polyhedral ordering cone C and for bounded as well as unbounded problems. Numerical results are provided to compare the proposed algorithm with an objective space based LVOP algorithm (Benson algorithm in [13]), that also provides a solution in the sense of [16], and with Evans-Steuer algorithm [12]. The results show that for non-degenerate problems the proposed algorithm outperforms Benson algorithm and is on par with Evan-Steuer algorithm. For highly degenerate problems Benson's algorithm [13] excels the simplex-type algorithms; however, the parametric simplex algorithm is for these problems computationally much more efficient than Evans-Steuer algorithm.

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

↑