点击次数：
论文类型：会议论文
发表时间：2006-01-01
收录刊物：CPCI-S
页面范围：1044-+
关键字：nonlinear programming; augmented lagrangian method; first-order optimality conditions
摘要：This paper formulates the problem of packing a given set of different-sized circles into a smallest possible square box as a nonlinear programming problem and establishes the first order optimality conditions. The augmented lagrangian method is applied to solve this problem and the computational experiments show its effectiveness.