线性规划短主元序列的存在性
On the existence of a short pivoting sequence for a linear program
摘要:
旋转方法对于线性规划是至关重要的,单纯形法是迄今为止最著名的。本文考虑了一对标准型线性规划的原始-对偶问题。我们发现,存在一个序列的枢轴,其长度是有界的约束矩阵的最小尺寸,使枢轴创建一个非奇异的子矩阵的约束矩阵增加了一行和一列,在每次迭代。求解这些子矩阵中的每一个的一对线性方程组生成一个原始-对偶线性规划对的最优解序列,该原始-对偶线性规划对的维数增加,起源于原点。在最后一步中得到原始-对偶线性规划对的最优解。它只是一个存在性结果,我们还不能根据问题的性质生成任何规则来生成序列。结果通过最终基矩阵的分解获得。
英文摘要:
Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence of pivots, whose length is bounded by the minimum dimension of the constraint matrix, such that the pivot creates a nonsingular submatrix of the constraint matrix which increases by one row and one column at each iteration. Solving a pair of linear equations for each of these submatrices generates a sequence of optimal solutions of a primal-dual pair of linear programs of increasing dimensions, originating at the origin. The optimal solutions to the original primal-dual pair of linear programs are obtained in the final step. It is only an existence result, we have not been able to generate any rules based on properties of the problem to generate the sequence. The result is obtained by a decomposition of the final basis matrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。