The flows in nets with generalized conservation principle (Q2739971)

Let us consider the finite connected graph \(G=(V,E)\), where \(V\) and \(E\) are the sets of the nodes and the edges of the graph, respectively. The graph is supposed to be non-oriented. Let \(N(j)=\{i\in V:(i,j)\in E\}\). The authors study the following system of inequalities with respect to the unknown \(x_{ij}\): NEWLINE\[NEWLINE\sum_{j\in N(i)}\alpha_{ij}x_{ij}\in A_{i} \quad \text{for} i\in V, \;x_{ij}\in B_{ij},(i,j)\in E,NEWLINE\]NEWLINE where \(A_{i}, B_{ij}\) are some intervals and \(\alpha_{ij}\neq 0\). The elimination method for groups of unknowns is presented.