A Monotonization Method in Nonlinearing Prosramming Problem

In this paper a monotonization method is given to a kind of nonmonotone nonlinearing programming problem with some monotone constraints.Then this kind of nonmonotone nonlinearing programming problem can be converted into an equivalent monotone programming problem via this monotonization method.By using the existing convexification and concavification methods the converted monotone programming problem can be converted into an equivalent concave minimization problem or reverse convex programming problem or canonic D.C.programming problem.Therefore,the global minimizer of the original programming problem can be obtained by the existing algorithms about the converted structured problems.