论文部分内容阅读
This paper presents a network algorithm for realizing constructively the FarkasLemma arising from the so-called quasi-generalized network. This algorithm is stonglypolynomial when the network is a quasi-pure network, and turns out the Minty’s PaintingMethod when the network is a pure network.
This algorithm is stongly polynomial when the network is a quasi-pure network, and turns out the Minty’s Painting Method when the network is a pure network.