We show that the simplex method can be interpreted as a cutting-plane method, assumed that a special pricing rule is used. This approach is motivated by the recent success of the cutting-plane method in the solution of special stochastic programming problems. We compare the classic Dantzig pricing rule and the rule that derives from the cutting-plane approach. We focus on the special linear programming problem of finding the largest ball that fits into a given polyhedron.
Article
View Implementing the simplex method as a cutting-plane method