| 解可分离约束双凹规划问题的一种外逼近方法[英文] |
| |
| 引用本文： | 高岳林,徐成贤.解可分离约束双凹规划问题的一种外逼近方法[英文][J].应用数学,2002,15(3):42-46. |
| |
| 作者姓名： | 高岳林 徐成贤 |
| |
| 作者单位： | 西安交通大学理学院,陕西,西安,710049 |
| |
| 基金项目： | ThisworkissupportedbyNNSFofChina(199710 6 5 ) |
| |
| 摘 要： | 在本文中，我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件，并构造了一个有限终止外逼近算法。
|
| 关 键 词： | 双凹规划 广义凹规划 整体优化 外逼近方法 可分离约束 |
An Outer Approximation Method for Solving the Biconcave Programs with Separable Linear Constraints |
| |
| GAO Yue lin,XU Cheng xian.An Outer Approximation Method for Solving the Biconcave Programs with Separable Linear Constraints[J].Mathematica Applicata,2002,15(3):42-46. |
| |
| Authors: | GAO Yue lin XU Cheng xian |
| |
| Abstract: | In this paper, we put forward biconcave programming problem and generalized concave programming problem more generally. We give the global optimality conditions of biconcave programming programming problem and structure a outer approximation algorithm for solving the biconcave programming problem with separable linear constraints. |
| |
| Keywords: | biconcave programming generalized concave programming global optimization outer approximation method separable constraints |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
