论文部分内容阅读
In this paper,we present a central cutting plane algorithm for solving convex min-max semi-infinite programming problems.Because the objective function here is non-differentiable,we apply a smoothing technique to the considered problem and develop an algo