作者：
Li, D.Wang, J.Sun, X. L.Chinese Univ Hong Kong
Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China Qingdao Univ
Int Business Coll Dept Management Sci & Engn Qingdao 266071 Peoples R China Fudan Univ
Dept Management Sci Sch Management Shanghai 200433 Peoples R China
In this paper, we propose a convergent Lagrangian and objective level cut method for computing exact solution to two classes of nonlinearintegerprogramming problems: separable nonlinear integer programming and polyn...
详细信息
In this paper, we propose a convergent Lagrangian and objective level cut method for computing exact solution to two classes of nonlinearintegerprogramming problems: separable nonlinear integer programming and polynomial zero-one programming. The method exposes an optimal solution to the convex hull of a revised perturbation function by successively reshaping or re-confining the perturbation function. The objective level cut is used to eliminate the duality gap and thus to guarantee the convergence of the Lagrangian method on a revised domain. Computational results are reported for a variety of nonlinearintegerprogramming problems and demonstrate that the proposed method is promising in solving medium-size nonlinearintegerprogramming problems.
暂无评论