CAPACITY AND MAXIMAL VALUE OF TilE NETWOHK FLOW WITII MULTIPLICATIVE CONSTHAINTS Va ssil SG UREV

Ma Ria Na N, Iko Lova
1997 YugoslavJournal of Ope rations Rese arch   unpublished
A class of ne twor k flows, called multiplica ti ve or Mflowe is investigated in this paper. Mflcws arc s ubject to m u lti plicative capacity const rai nts. These constrai nts are su ms of products wit h posi tive coe fficients of flow function values on t he arcs of s ubse ts of the network a rcs. A defin ition is give n t o t he flow ca pacity of a cu tt ing set. Maximelity condit ions for m ult iplicat ive flow opt ima lity a re obtained. A theo re m, analogou s to the mi ncu t-max flow
more » ... re m for the class ical ne twor k flow is proved. Keywords Net work Ilow, general ized now, side cons t ra ints.
fatcat:6ioybttfgjh7baf4zvy3i4w5bq