| 一类线性约束非线性规划问题的一个凸集分离算法 |
| |
| 引用本文： | 范玉妹.一类线性约束非线性规划问题的一个凸集分离算法[J].首都师范大学学报(自然科学版),1993(1). |
| |
| 作者姓名： | 范玉妹 |
| |
| 作者单位： | 北京科技大学数力系 |
| |
| 摘 要： | 本文应用凸分析理论与方法对一类带线性约束的非线性规划问题提出了一种算法,并就本算法对二次规划问题进行了探讨。计算实例表明本文提出的算法是有效的,计算量较小。
|
| 关 键 词： | 线性约束 非线性规划 凸集分高超平面 导出规划 |
An Algorithm of Convex Set Separation for Nonlinear Programming Problems with Linear Restriction |
| |
| Fan Yumei.An Algorithm of Convex Set Separation for Nonlinear Programming Problems with Linear Restriction[J].Journal of Capital Normal University(Natural Science Edition),1993(1). |
| |
| Authors: | Fan Yumei |
| |
| Institution: | Fan Yumei Department of Mathematics and Physics,Beijing Institute of Science and Technology |
| |
| Abstract: | Based on the theory of convex analysis, an algorithm for monlinear programming problemswith linear restriction is proposed and a discussion quadratic programming is discussed. The exam-ples show this algorithm is effective and less computation. |
| |
| Keywords: | linear restriction nonlinear programming hyperplane of convex set separation derivation programming |
| 本文献已被 CNKI 等数据库收录！ |
