The Relaxation Method for Linear Inequalities
暂无分享,去创建一个
In various numerical problems one is confronted with the task of solving a system of linear inequalities: (1.1) (i = 1, … ,m) assuming, of course, that the above system is consistent. Sometimes one has, in addition, to minimize a given linear form l(x). Thus, in linear programming one obtains a problem of the latter type.
[1] G. TEMPLE,et al. Relaxation Methods in Engineering Science , 1942, Nature.
[2] George E. Forsythe,et al. Solving linear algebraic equations can be interesting , 1953 .