| 二层规划的神经网络解法 |
| |
| 引用本文： | 彭爱民.二层规划的神经网络解法[J].数学杂志,2014,34(1):111-115. |
| |
| 作者姓名： | 彭爱民 |
| |
| 作者单位： | 湖北第二师范学院数学与数量经济学院 |
| |
| 摘 要： | 本文研究了基于神经网络的二层规划问题.利用互补松弛条件的扰动,获得了二层规划问题局部最优解的充分条件,克服了互补松弛条件不满足约束规格的局限性,并给出了相应的神经网络求解方法,从而求解原二层规划问题,数值实验表明算法有效.
|
| 关 键 词： | 二层规划 扰动 约束规格 神经网络 |
| 收稿时间： | 2012/11/24 0:00:00 |
| 修稿时间： | 2012/11/5 0:00:00 |
NEURAL NETWORKS SOLUTION OF BILEVEL PROGRAMMING PROBLEM |
| |
| PENG Ai-min.NEURAL NETWORKS SOLUTION OF BILEVEL PROGRAMMING PROBLEM[J].Journal of Mathematics,2014,34(1):111-115. |
| |
| Authors: | PENG Ai-min |
| |
| Institution: | PENG Ai-min;School of Mathematics and Quantitative Economics,Hubei University of Education; |
| |
| Abstract: | Here is the abstract of bilevel programming based on neural networks. By using complementarity constraints, a sufficient condition is considered. It improves the drawback that constraint qualification does not hold at any feasible point when a bilevel programming is changed into a single one. We arrive at a conclusion of neural networks solution for bilevel programming. The validity of the networks is demonstrated by several numerical examples. |
| |
| Keywords: | bilevel programming perturted constraint qualification neural networks |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学杂志》浏览原始摘要信息 |
| 点击此处可从《数学杂志》下载免费的PDF全文 |
