A network flow problem that allows gains or losses along the arcs is called a:

Group of answer choices

transshipment model with linear side constraints.

generalized network flow model.

non$-$directional, shortest path model.

a minimum cost network flow model.