Methodology and analysis for comparing discrete linear l1 approximation codes
暂无分享,去创建一个
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”.
[1] Abraham Charnes,et al. Optimal Estimation of Executive Compensation by Linear Programming , 1955 .
[2] Nabih N. Abdelmalek. An efficient method for the discrete linear ₁ approximation problem , 1975 .
[3] Edward L. Frome,et al. A Comparison of Two Algorithms for Absolute Deviation Curve Fitting , 1976 .
[4] James E. Gentle,et al. On least absolute values estimation , 1977 .