论文部分内容阅读
In this paper, we studied the dual form of the basic line algorithm for linearprograms. It can be easily implemented in a tableau that similar to the primal/dualsimplex method. Different from primal simplex method or dual simplex method,the dual basic line algorithm can keep primal feasibility and dual feasibility atthe same time in a tableau, which makes it more efficient than the former ones.Principles and convergence of dual basic line algorithm were discussed. Someexamples and computational experience were given to illustrate the efficiency ofour method.