| 带有一个反凸约束的线性规划 |
| |
| 引用本文： | 邵建峰.带有一个反凸约束的线性规划[J].陶瓷科学与艺术,1996(1). |
| |
| 作者姓名： | 邵建峰 |
| |
| 作者单位： | 南京化工大学基础科学系!南京，210009 |
| |
| 摘 要： | 带有一个反凸约束的线性规划，其可行域一般是非凸不连通集，因而这是一类困难的全局解问题。在回顾了已有的理论和方法之后，给出了这个问题的一个切割-转轴算法。算法收敛到或有限步内终止于问题的全局解。并且给出了执行算法的例子。
|
| 关 键 词： | 全局规划 反凸约束 不连通区域 切平面 |
LINEAR PROGRAMS WITH ADDITIONAL REVERSE CONVEX CONSTRAINT |
| |
| Shao Jianfeng.LINEAR PROGRAMS WITH ADDITIONAL REVERSE CONVEX CONSTRAINT[J].Ceramics Science & Art,1996(1). |
| |
| Authors: | Shao Jianfeng |
| |
| Abstract: | Linear programmign with an additional reverse convex constraint, whose feasibe region is generally monconvex and disconnected set, is a class of difficult global optimal problems. After looking back on given theories and methods, a cut-pivoting algorithm is presented, showing that the algorithm converges to or terminates in finite steps at the grobal optimal solution of the problem. And the examples of the method are alsi provided. |
| |
| Keywords: | global programming reverse convex constraint disconnected regions cutting planes |
| 本文献已被 CNKI 等数据库收录！ |
