|
|||||
|
|
| 带有多个反凸约束的线性规划 | |
| 引用本文： | 邵建峰. 带有多个反凸约束的线性规划[J]. 陶瓷科学与艺术, 1995, 0(Z1) |
| 作者姓名： | 邵建峰 |
| 作者单位： | 南京化工大学基础科学系 |
| 摘 要： | 讨论带有多个反凸约束的线性规划。这类问题由于其内在困难性（可行域一般为非凸不连通集）而难以求解．提出了一个切平面算法，并对Ｈｉｌｌｅｓｔａｄ的例子执行了算法。 |
| 关 键 词： | 线性规划，反凸约束，全局解，切平面 |
LINEAR PROGRAMS WITH SEVERAL REVERSE CONVEX CONSTRAINTS |
|
| Shao Jianfeng. LINEAR PROGRAMS WITH SEVERAL REVERSE CONVEX CONSTRAINTS[J]. Ceramics Science & Art, 1995, 0(Z1) | |
| Authors: | Shao Jianfeng |
| Abstract: | Linear programs with several reverse convex constraints are discussed. Such problems, because of their intrinsic difficulties (the feasible regions are generally nonconvex and disconnected sets), were found to be hard to solve. A cutting plane algorithm is presented here, and the method is tested for the Hillestad' s example. |
| Keywords: | linear programming reverse convex constraints global optimal cutting plane |
| 本文献已被 CNKI 等数据库收录！ | |