| 对偶性和线性规划问题的神经网络解法 |
| |
| 引用本文： | 田大钢.对偶性和线性规划问题的神经网络解法[J].自动化学报,2003,29(2):219-226. |
| |
| 作者姓名： | 田大钢 |
| |
| 作者单位： | 1.上海理工大学管理学院,上海 |
| |
| 基金项目： | theNational 86 3Plan(2 0 0 2AA4 14 310 ) |
| |
| 摘 要： | 通过一种新的对偶形式,得到一种新的易于实现的解线性规划问题的神经网络,证明了
网络具有全局指数收敛性,使得线性规划问题的神经网络解法趋于完善.
|
| 关 键 词： | 对偶性 神经网络 线性规划 |
| 收稿时间： | 2001-5-9 |
Duality and Neural Networks for Solving Linear Programming |
| |
| TIAN Da-Gang.Duality and Neural Networks for Solving Linear Programming[J].Acta Automatica Sinica,2003,29(2):219-226. |
| |
| Authors: | TIAN Da-Gang |
| |
| Affiliation: | 1.College of Management,University of Shanghai Science and Technology,Shanghai |
| |
| Abstract: | By means of new theorems on duality, a sort of recurrent neural network for solving linear programming problems is given, which can be realized easily by circuits. The algorithm's exponentially asymptotic stability in the whole is proven. It makes the neural computing approach for linear programming trend to perfect. |
| |
| Keywords: | Duality neural network linear programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
