Abstract
In this chapter, we discuss the following special classes of linear-fractional programming problems: transportation problems, assignment problems, and transshipment problems. While each of these problems can be solved by the simplex method, there are specialized algorithms for each type of problems that are much more efficient than the simplex algorithm.
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
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bajalinov, E.B. (2003). Special LFP Problems. In: Linear-Fractional Programming Theory, Methods, Applications and Software. Applied Optimization, vol 84. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9174-4_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9174-4_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4822-1
Online ISBN: 978-1-4419-9174-4
eBook Packages: Springer Book Archive