Methods of the Convex Cone Theory in the Feasibility Problem of Multicommodity Flow
The feasibility problem of multicommodity flow is reduced to finding out if a multidimensional vector determined by the network parameters belongs to a convex polyhedral cone determined by the set of paths in the network. It is shown that this representation of the feasibility problem makes it possible to formulate the feasibility criterion described in  in a different form. It is proved that this criterion is sufficient. The concepts of reference vectors and networks are defined, and they are used to describe a method for solving the feasibility problem for an arbitrary network represented by a complete graph.
Keywordsmulticommodity flow feasibility criterion polyhedral cone multivertex graph
Unable to display preview. Download preview PDF.
- 1.A. B. Papernov, “Realizability of multicommodity flows,” in Discrete Optimization Studies (Nauka, Moscow, 1976), pp. 230–261 [in Russian].Google Scholar
- 3.T. C. Hu, Integer Programming and Network Flows (Addison–Wesley, Reading, Mass., 1970; Mir, Moscow, 1974).Google Scholar
- 5.B. N. Pshenichyi, Convex Analysis and Extremum Value Problems (Nauka, Moscow, 1980) [in Russian].Google Scholar
- 7.M. R. Davidson, “Stability of the lexicographic maximin problem of distributing flows in multicommodity networks,” Zh. Vychisl. Mat. Mat. Fiz. 35, 334–351 (1995).Google Scholar