Vector network equilibrium problems with capacity constraints of arcs

In this paper, we study a (weak) vector equilibrium principle with capacity constraints of arcs and common arcs in some different paths. We obtain some necessary and sufficient conditions for a (weak) vector minimum cost flow. By virtue of a (weak) Δ-equilibrium principle, we also derive some necessary and sufficient conditions for a weak vector equilibrium flow.