摘要
给出了满足一定条件的数学规划问题的一个新的凸化、凹化方法,从而将这一类规划问题转化为等价的凹极小问题,再利用已有的算法求解该问题。
In this paper,a new method of convexification and concavification for a kind of programming problem is proposed. Then the programming problem can be converted into an equivalent concave minimization problem. The global optimal solution for the primal programming problem can be obtained by solving the concave minimization problem via using the existing algorithms.
出处
《贵州师范大学学报（自然科学版）》
CAS
2005年第3期60-62,共3页
Journal of Guizhou Normal University：Natural Sciences
基金
国家自然科学基金资助项目(NO.10171118)
重庆市教委资助项目(030809)
关键词
凸化
凹化
凹极小问题
convexification
concavification
concave minimization problem
