**:** . .,

. .
**:**
**:**
**:**
**:** 2009
**:** ..

** :**
**:** 24
**:** . ., . . / . 24. .: , 2009. .147-168.

**. :** 04200900023/0008

**:** -
** :** , , ,

** (.):** resource allocation problems, hierarchical transporttype systems, network flows, infeasible linear inequality systems

**:**
.

.

.

, .

** (.):** The paper covers the problem of finding flow in infeasible

transport type network with two-side arc capacities. Minimization

problem of overall penalty for capacities modification was

considered while investigating of infeasible network flow models.

Proposed algorithm of solving the considered problem is based on

reduction to min-cost network flow problem. In the case of

tree-like network algorithm of solving the considered problem

based on bounds reduction method is proposed.

PDF
: 4411, : 990, : 11.