| 一类全局优化问题的新的凸化、凹化法 |
| |
| 引用本文： | 何颖. 一类全局优化问题的新的凸化、凹化法[J]. 长春大学学报, 2008, 18(2): 1-6 |
| |
| 作者姓名： | 何颖 |
| |
| 作者单位： | 海军航空工程学院青岛分院机械系基础教研室 山东青岛266000 |
| |
| 基金项目： | 重庆市教委基金资助项目（030801）,重庆市科委研究基金资助项目（8409） |
| |
| 摘 要： | 对于目标函数非凸非凹,而约束函数具有凹、凸性的非线性规划问题,本文提出了一种新的凸化凹化法。把目标函数直接凸化、凹化,再把原问题转化为反凸规划问题或极小化问题或标准D.C.规划问题,从而求得原问题的全局最优解。
|
| 关 键 词： | 运筹学 全局最优化问题 反凸规划问题 凹极小问题 |
A new method of convexification and concavification for a kind of global optimization |
| |
| HE Ying. A new method of convexification and concavification for a kind of global optimization[J]. Journal of Changchun University, 2008, 18(2): 1-6 |
| |
| Authors: | HE Ying |
| |
| Affiliation: | HE Ying (Basic Office of Mechanical Engineering Department, Qingdao Branch of Naval Aeronautical Engineering Institute, Qingdao 266000, China) |
| |
| Abstract: | This paper proposes a kind of convexification and concavification method to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions.Then it proves that the original programming problems can be converted into an equivalent concave minimization problem,or reverse convex programming problem,or canonical D.C.programming problem. |
| |
| Keywords: | operational research global optimization problem reverse convex programming problem convex minimization problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
