In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program.

• 二分单纯形算法中,线性规划问题的最优解是通过求解一系列子问题来实现的。