Methods of the Convex Cone Theory in the Feasibility Problem of Multicommodity Flow


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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 [1] 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.

About the authors

Ya. R. Grinberg

Kharkevich Institute for Information Transmission Problems

Author for correspondence.
Email: greenjak@yandex.ru
Russian Federation, Moscow, 127051

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.