Abstract: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.