摘要
This paper considers the concave minimization problem with linear constrailits,proposes a technique which may avoid the unsuitable Karush-Kuhn-Tucker poiats,then combines this technique with nank-Wolfe method and simplex method to form a pivoting method which can determine a strictly local minimizer of the problem in a finite number of iterations. Basing on strictly local minimizers, a new cutting plane method is proposed. Under some mild conditions, the new cutting plane method is proved to be finitely terminated at an θ-global minimizer of the problem.
This paper considers the concave minimization problem with linear constrailits,proposes a technique which may avoid the unsuitable Karush-Kuhn-Tucker poiats,then combines this technique with nank-Wolfe method and simplex method to form a pivoting method which can determine a strictly local minimizer of the problem in a finite number of iterations. Basing on strictly local minimizers, a new cutting plane method is proposed. Under some mild conditions, the new cutting plane method is proved to be finitely terminated at an θ-global minimizer of the problem.
