单纯形法生成的不同基本解个数的一个界
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
摘要:
本文对具有最优解的线性规划问题,给出了单纯形法生成的不同基本可行解个数的一个上界。该界是约束个数、变量个数和原始基本可行解的所有正元素的最小值与最大值之比的多项式。当原问题是非退化的,它成为一个限制的迭代次数。当它应用于特殊的线性规划问题时,我们给出了一些基本结果。本文的结果包括了叶先生关于马尔可夫判定问题的单纯形法的强多项式性,并利用了它的分析。
英文摘要:
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints, the number of variables, and the ratio between the minimum and the maximum values of all the positive elements of primal basic feasible solutions. When the primal problem is nondegenerate, it becomes a bound for the number of iterations. We show some basic results when it is applied to special linear programming problems. The results include strongly polynomiality of the simplex method for Markov Decision Problem by Ye and utilize its analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。