The Relaxation Method for Linear Inequalities

Canadian Journal of Mathematics - Tập 6 - Trang 382-392 - 1954
Shmuel Agmon1,2
1National Bureau of Standards at Los Angeles, The Hebrew University, Jerusalem
2The Rice Institute, Houston, Texas, University of California at Los Angeles

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

Motzkin, 1953, The double description method, in Contributions to the Theory of Games, Annals of Mathematics Series, 2, 51

10.1098/rspa.1939.0012

Southwell, 1946

10.1090/S0002-9904-1953-09718-X

Dantzig G. B. , Maximization of a linear form whose variables are subject to a system of linear inequalities (U.S.A.F., 1949), 16 pp.

Southwell, 1940

Linear programming seminar notes, Institute for Numerical Analysis (Los Angeles, 1950).