Indexed metadata
The Relaxation Method for Linear Inequalities
Shmuel Agmon
Source record
Source: Crossref
Published: Jan 1, 1954
DOI: 10.4153/cjm-1954-037-2
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.