Kirby, M. J. L.; Love, H. R.; Swarup, Kanti - In: Management Science 18 (1972) 9, pp. 540-549
The paper considers a class of optimization problems. The problems are linear programming problems: maximize cx subject to Ax = b with the additional constraint that x must also be an extreme point of a second convex polyhedron Dx = d, x \geqq 0. A cutting-plane algorithm for solving such...