论文部分内容阅读
A general monotonization method is proposed for converting a constrained programming problem with non-monotone objective function and monotone constraint functions into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existingconvexification and concavefication methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.