期刊:SIAM journal on control [Society for Industrial and Applied Mathematics] 日期:1971-11-01卷期号:9 (4): 529-542被引量:125
标识
DOI:10.1137/0309037
摘要
This paper introduces a master cutting plane algorithm for nonlinear programming that isolates the points it generates from one another until a solution is achieved. The master algorithm provides a foundation for the study of cutting plane algorithms and directs the way for development of procedures which permit deletion of old cuts.