点击次数：

发表时间：2008-01-01

发表刊物：大连理工大学学报

期号：2

页面范围：308-312

ISSN号：1000-8608

摘要：As a class of combinatorial optimization problems with many important applications, two-dimensional strip-packing problems are quite difficult to be solved accurately as they are NP hard. A two-dimensional strip-packing problem is formulated as a nonlinear programming (NLP) model and the notion of tangent cones in variational analysis is employed to establish the first-order optimality conditions for the NLP problem. The augmented Lagrange method is presented to solve this NLP problem and specific problems are solved by it. Numerical results show that the augmented Lagrange method is suitable for solving this NLP problem and it is able to find exact solutions to strip-packing problems involving up to 10 items.

备注：新增回溯数据