In this paper a dual simplex method for linear programming with bounded variables was given, which generalizes and extends the classic dual simplex method for a general linear programming.

• 摘要给出变量有上界的线性规划问题的对偶单纯形算法，该算法包含了一般线性规划问题的对偶单纯形算法，为解变量有上界的线性规划问题提供了又一种方法。