Linear Programming Techniques for Regression Analysis
Harvey M. Wagner · Journal of the American Statistical Association · 1959
In regression problems alternative criteria of “best fit” to least squares are least absolute deviations and least maximum deviations. In this paper it is noted that linear programming techniques may be employed to solve the latter two problems. In particular, if the linear regression relation contains p parameters, minimizing the sum of the absolute value of the “vertical” deviations from the regression line is shown to reduce to a p equation linear programming model with bounded variables; and fitting by the Chebyshev criterion is exhibited to lead to a standard-form p+1 equation linear programming model.
Cited by 308 works. doi:10.1080/01621459.1959.10501506
Authors
References
- An Introduction to Linear Programming
- Approximations for Digital Computers
- Linear Inequalities and Related Systems.
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
- Optimal Estimation of Executive Compensation by Linear Programming
- An Introduction to Linear Programming.
- An Application of Linear Programming to Curve Fitting
- The dual simplex algorithm for bounded variables
- Linear Curve Fitting Using Least Deviations
- A Practical Guide to the Dual Theorem