Abstract
A method for improving local optimal solutions of nonlinear programming problems by treating equality constraints directly, named "Modal Trimming Method, " has been proposed, and it has turned out that the method has a high possibility of deriving the global optimal solutions by the suboptimal ones for a wide range of problems. It has been shown that this feature is because the renewal of solutions based on the extended Newton-Raphson method creates a chaotic behavior of the solutions, and a strategy for improving the capability of global search has been proposed. In this paper, a strategy for treating inequality constraints directly is proposed, and it turns out that the trap into local optimal solutions located on the boundaries of inequality constraints can be avoided. The modal trimming method with these strategies is applied to a variety of test problems, and its validity and effectiveness are clarified.
