摘要
对一类约束函数单调而目标函数非单调的非线性规划问题,给出了将其目标函数单调化的一种方法。通过这些方法可将这类非凸非单调的非线性规划问题转化为等价的单调规划问题,进而再利用已有的关于单调函数的凸化、凹化方法,可将其转化为等价的凹极小问题、或反凸规划问题或标准D.C.规划问题,再利用已有的关于这些规划问题求全局极小点的方法,可以求得原问题的全局极小点。
In this paper a monotonization method is given to a kind of nonmonotone nonlinearing programming problem with some monotone constraints.Then this kind of nonmonotone 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.
出处
《重庆师范大学学报（自然科学版）》
CAS
2004年第2期4-7,11,共5页
Journal of Chongqing Normal University:Natural Science
基金
国家自然科学基金(NO.10171118)
重庆市教委资助项目(030809)
