Abstract
In this chapter we will discuss some ways to cut down the number of arithmetic operations per iteration for the logarithmic barrier method for linear programming, analyzed in Section 2.3. The analysis given in this chapter can easily be extended to the center method, because of the close relationship between the logarithmic barrier and the center method as explained in Section 3.3.
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
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
den Hertog, D. (1994). Reducing the complexity for LP. In: Interior Point Approach to Linear, Quadratic and Convex Programming. Mathematics and Its Applications, vol 277. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1134-8_4
Download citation
DOI: https://doi.org/10.1007/978-94-011-1134-8_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4496-7
Online ISBN: 978-94-011-1134-8
eBook Packages: Springer Book Archive