Skip to main content

Regression

  • Chapter
  • 2336 Accesses

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

Abstract

In this chapter, we shall study an application of linear programming to an area of statistics called regression. As a specific example, we shall use size and iteration-count data collected from a standard suite of linear programming problems to derive a regression estimate of the number of iterations needed to solve problems of a given size.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  • Gonin, R., and Money, A. (1989), Nonlinear L p -Norm Estimation, Marcel Dekker, New York-Basel. 208

    Google Scholar 

  • Dodge, Y., ed. (1987), Statistical Data Analysis Based on The L’-Norm and Related Methods, North-Holland, Amsterdam. 208

    Google Scholar 

  • Bloomfield, P., and Steiger, W. (1983), Least Absolute Deviations: Theory, Applications, and Algorithms, Birkhäuser, Boston. 208

    Google Scholar 

  • Smale, S. (1983), ‘On the average number of steps of the simplex method of linear

    Google Scholar 

  • programming’, Mathematical Programming 27, 241–262. 53, 124, 208

    Google Scholar 

  • Borgwardt, K.-H. (1982), ‘The average number of pivot steps required by the simplex-method is polynomial’, Zeitschrift far Operations Research 26, 157–177. 53, 124, 208

    Google Scholar 

  • Borgwardt, K.-H. (1987a), Probabilistic analysis of the simplex method, in ‘Operations Research Proceedings, 16th DGOR Meeting’, pp. 564–576. 53, 208

    Google Scholar 

  • Adler, I. & Megiddo, N. (1985), ‘A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension’, Journal of the ACM 32, 871–895. 53, 208

    Google Scholar 

  • Todd, M. (1986), ‘Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming’, Mathematical Programming 35, 173192. 53, 208

    Google Scholar 

  • Adler, I. & Berenguer, S. (1981), Random linear programs, Technical Report 81–4, Operations Research Center Report, U.C. Berkeley. 209

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Robert J. Vanderbei

About this chapter

Cite this chapter

Vanderbei, R.J. (2001). Regression. In: Linear Programming. International Series in Operations Research & Management Science, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5662-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5662-3_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-5664-7

  • Online ISBN: 978-1-4757-5662-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics