2 LINEAR-PROGRAMMING ALGORITHMS FOR THE LINEAR DISCRETE L1 NORM PROBLEM

被引:7
作者
ARMSTRONG, RD [1 ]
GODFREY, JP [1 ]
机构
[1] CENT INTELLIGENCE AGCY,DIV ECON PLANNING,WASHINGTON,DC
关键词
D O I
10.2307/2006041
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:289 / 300
页数:12
相关论文
共 15 条
[1]  
Abdelmalek N. N., 1974, Journal of Approximation Theory, V11, P38, DOI 10.1016/0021-9045(74)90037-9
[2]   EFFICIENT METHOD FOR DISCRETE LINEAR L1 APPROXIMATION PROBLEM [J].
ABDELMALEK, NN .
MATHEMATICS OF COMPUTATION, 1975, 29 (131) :844-850
[3]   ALGORITHM FOR A RESTRICTED DISCRETE APPROXIMATION PROBLEM IN L1 NORM [J].
ARMSTRONG, RD ;
HULTZ, JW .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1977, 14 (03) :555-565
[4]  
ARMSTRONG RN, UNPUBLISHED
[5]   IMPROVED ALGORITHM FOR DISCRETE L1 LINEAR-APPROXIMATION [J].
BARRODALE, I ;
ROBERTS, FDK .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1973, 10 (05) :839-848
[6]   OPTIMALITY AND DEGENERACY IN LINEAR PROGRAMMING [J].
Charnes, A. .
ECONOMETRICA, 1952, 20 (02) :160-170
[7]  
CHARNES A, 1961, MANAGEMENT MODELS IN, V2
[8]  
CHARNES A, 1955, MANAGE SCI, V2, P138
[9]  
GILSINN J, 1977, COMM STATIST B, V6
[10]  
Hadley G., 1962, LINEAR PROGRAMMING