Linear-Fractional Network Problem With Additional Constraints

Abstract

Primal support relaxation algorithm is considered for the network problem of the fractional programming with additional constraints. The algorithm includes network criterion of support, criterion of optimization, development of increment of objective function formula and building of usable direction of flow changing. The analytical expressions of an evaluation vector are obtained on the ground of network properties of a basis of the solution space of the undetermined system of linear equations with the incidence matrix of the network. It allows not to use a system of potentials on iterations.