返回
A new neural network model for solving random interval linear programming problems
DOI:10.1016/j.neunet.2016.12.007.png)
摘要
En 中文
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Random interval linear programming
Satisfactory solution
Convex second order cone programming
Neural network
Convergent
Stability
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.8K
被引数:
3.0W
机构
引用论文
Exponential stability of stochastic memristor-based recurrent neural networks with time-varying delays
NEUROCOMPUTING
IF6.5
A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
NEURAL NETWORKS
IF6.3
Perceptions of violence and fear of school attendance among junior high school students in Israel以色列初中学生对暴力的看法和对上学的恐惧

