Skip to main content

The Affine-Scaling Method

  • Chapter
Linear Programming

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 196))

  • 179k Accesses

Abstract

In the previous chapter, we showed that the step direction for the path-following method can be decomposed into a linear combination of three directions: a direction toward optimality, a direction toward feasibility, and a direction toward centrality. It turns out that these directions, or minor variants of them, arise in all interior-point methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  • Barnes, E. (1986). A variation on Karmarkar’s algorithm for solving linear programming problems. Mathematical Programming, 36, 174–182.

    Article  Google Scholar 

  • Dikin, I. (1967). Iterative solution of problems of linear and quadratic programming. Soviet Mathematics Doklady, 8, 674–675.

    Google Scholar 

  • Dikin, I. (1974). On the speed of an iterative process. Upravlyaemye Sistemi, 12, 54–60.

    Google Scholar 

  • Hall, L., and Vanderbei, R. (1993). Two-thirds is sharp for affine scaling. OR Letters, 13, 197–201.

    Google Scholar 

  • Karmarkar, N. (1984). A new polynomial time algorithm for linear programming. Combinatorica, 4, 373–395.

    Article  Google Scholar 

  • Mascarenhas, W. (1997). The affine scaling algorithm fails for λ = 0. 999. SIAM Journal on Optimization, 7, 34–46.

    Google Scholar 

  • Saigal, R. (1995). Linear programming. Boston: Kluwer.

    Book  Google Scholar 

  • Tsuchiya, T., and Muramatsu, M. (1992). Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems. SIAM Journal on Optimization, 5(3), 525–551.

    Article  Google Scholar 

  • Vanderbei, R. (1989). Affine scaling for linear programs with free variables. Mathematical Programming, 43, 31–44.

    Article  Google Scholar 

  • Vanderbei, R., Meketon, M., and Freedman, B. (1986). A modification of Karmarkar’s linear programming algorithm. Algorithmica, 1, 395–407.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Vanderbei, R.J. (2014). The Affine-Scaling Method. In: Linear Programming. International Series in Operations Research & Management Science, vol 196. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-7630-6_21

Download citation

Publish with us

Policies and ethics