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 iterationcount 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.
KeywordsLinear Programming Problem Simplex Method Facility Location Problem Exam Score Regular Employee
Unable to display preview. Download preview PDF.
- Gay, D. (1985), ‘Electronic mail distribution of linear programming test problems’, Mathematical Programming Society COAL Newslettter 13, 10–12.Google Scholar
- Dodge, Y., ed. (1987), Statistical Data Analysis Based on The L1-Norm and Related Methods, North-Holland, Amsterdam.Google Scholar
- Borgwardt, K.-H. (1987a), Probabilistic analysis of the simplex method, in ‘Operations Research Proceedings, 16th DGOR Meeting’, pp. 564–576.Google Scholar
- Adler, I. & Berenguer, S. (1981), Random linear programs, Technical Report 81-4, Operations Research Center Report, U.C. Berkeley.Google Scholar