A dual basic method for solving the problem of a minimal cost flux on a generalized network

The paper is concerned with a generalized network $S$ where, unlike the conventional one, at the end of each arc $(i, j)$ there is a point with a parameter $\lambda_{ij}$ where the arc flux $x_{ij}$ is transformed into a flux $\lambda_{ij}x_{ij}$. On the network $S$ a flux о minimal cost is sought among all the fluxes. The problem is a network analog of the allocation problem. A dual solution method is suggested improbable by using bases.