scientific article; zbMATH DE number 1484335
The neural network learning problem is formulated as the following LP-problem: Find \(x_j \geq 0\), \(j=1,\dots,n+1\) which satisfy the \(n^2 + 1\) constraints: \[ x_i-a_{si}x_s + h_i x_{n+1} \geq 0, \quad i \neq s,\;i,s=1,\dots,n, \] \[ x_i - x_{n+1} \geq 0, \quad i = 1,\dots,n, \] \[ x_1 + x_2 + \dots + x_n = 1 \] and maximize the linear form \(z = x_{n+1}\); all the \(a_{si}\), \(h_i\), \(0 \leq a_{si} < h_i \leq 1\) are assumed to be known. The authors consider directly the above stated LP-problem and characterize the extreme points of the set of feasible solutions. The process of solving the considered LP-problem seems effective, because the formulae and the computations are particularly simple.
- scientific article; zbMATH DE number 1484334
- Mathematical analysis of some neural networks for solving linear and quadratic programming
- An analysis of a class of neural networks for solving linear programming problems
- A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming
- A new neural network for solving linear programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4493288)