The optimal layout problem of circle group in a circular container with performance constraints of equilibrium belongs to a class of NP-hard problem. The key obstacle of solving this problem is the lack of an effective global optimization method. We convert the circular packing problem with...

Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, form a difficult class of optimization problems. The feasible set of MPECs is described by standard equality and inequality constraints as well as additional complementarity constraints that are used to...