Précis—Stability of the Dual Cutting-Plane Algorithm for Concave Programming

In the column generating approach to concave programming, alias the dual cutting-plane algorithm (Zangwill), Lagrangians are maximized to generate columns. Often this cannot be done in a finite number of steps. We show what to do.