An interval programming algorithm for discrete linear L1 approximation problems
- 31 December 1969
- journal article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 2 (4), 323-336
- https://doi.org/10.1016/0021-9045(69)90001-x
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- An Explicit Solution of a Special Class of Linear Programming ProblemsOperations Research, 1968
- Applications of Linear Programming to Numerical AnalysisSIAM Review, 1968
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete setNumerische Mathematik, 1966
- Methods—Old and New—for Solving the Tchebycheff Approximation ProblemJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1964
- Note on Jordan elimination, linear programming and Tchebycheff approximationNumerische Mathematik, 1960
- Linear Programming Techniques for Regression AnalysisJournal of the American Statistical Association, 1959
- The dual method of solving the linear programming problemNaval Research Logistics Quarterly, 1954