Methodology and analysis for comparing discrete linear l1approximation codes
- 1 January 1977
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- Vol. 6 (4) , 399-413
- https://doi.org/10.1080/03610917708812053
Abstract
This is the first of a projected series of papers dealing with computational experimentation in mathematical programming. This paper provides early results of a test case using four discrete linear L1 approximation codes. Variables influencing code behavior are identified and measures of performance are specified. More importantly, an experimental design is developed for assessing code performance and is illustrated using the variable “problem size”.Keywords
This publication has 3 references indexed in Scilit:
- On least absolute values estimationCommunications in Statistics - Theory and Methods, 1977
- A Comparison of Two Algorithms for Absolute Deviation Curve FittingJournal of the American Statistical Association, 1976
- Optimal Estimation of Executive Compensation by Linear ProgrammingManagement Science, 1955