A multiple penalty function method for solving Max-Bisection problems

A continuation algorithm for the solution of Max-Bisection problems is proposed in this paper. Unlike available relaxation algorithms for Max-Bisection problems, the Max-Bisection problems are converted to an equivalent continuous nonlinear programming by employing NCP functions, and the resulting nonlinear programming problem is then solved using the augmented Lagrange penalty function method. The convergence property and finite termination property of the proposed algorithm are studied, and numerical experiments and comparisons on the simple circuit partitioning problems are made. Results reported in section “Numerical experiments” show the algorithm generates satisfactory solutions to test problems.