Abstract
We have seen a number of quite sophisticated algorithms for the solution of linear programming problems. We shall now look at problems which are, in fact, of linear programming type, but which have structures that enable us to solve them in a much simpler way than by applying methods appropriate to the general form.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 S. Vajda
About this chapter
Cite this chapter
Vajda, S. (1981). Transportation and flow in networks. In: Linear Programming. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-6924-0_5
Download citation
DOI: https://doi.org/10.1007/978-94-011-6924-0_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-412-16430-9
Online ISBN: 978-94-011-6924-0
eBook Packages: Springer Book Archive