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.
KeywordsLinear Programming Problem Simplex Method Facility Location Problem Exam Score Regular Employee
Unable to display preview. Download preview PDF.
- Gonin, R., and Money, A. (1989), Nonlinear L p -Norm Estimation, Marcel Dekker, New York-Basel. 208Google Scholar
- Dodge, Y., ed. (1987), Statistical Data Analysis Based on The L’-Norm and Related Methods, North-Holland, Amsterdam. 208Google Scholar
- Bloomfield, P., and Steiger, W. (1983), Least Absolute Deviations: Theory, Applications, and Algorithms, Birkhäuser, Boston. 208Google Scholar
- Smale, S. (1983), ‘On the average number of steps of the simplex method of linearGoogle Scholar
- programming’, Mathematical Programming 27, 241–262. 53, 124, 208Google 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, 208Google Scholar
- Borgwardt, K.-H. (1987a), Probabilistic analysis of the simplex method, in ‘Operations Research Proceedings, 16th DGOR Meeting’, pp. 564–576. 53, 208Google 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, 208Google Scholar
- Todd, M. (1986), ‘Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming’, Mathematical Programming 35, 173192. 53, 208Google Scholar
- Adler, I. & Berenguer, S. (1981), Random linear programs, Technical Report 81–4, Operations Research Center Report, U.C. Berkeley. 209Google Scholar