1954/01/01 by Shmuel Agmon · 560 citations
Mathematics · Computer Science · #Advanced Optimization Algorithms Research #Matrix Theory and Algorithms #Iterative Methods for Nonlinear Equations #Mathematics #Relaxation (psychology) #Linear programming #Inequality #Linear inequality #Applied mathematics #Type (biology) #Linear system #Task (project management) #Mathematical optimization #Mathematical analysis
paper · pdf · doi:10.4153/cjm-1954-037-2
published in Canadian Journal of Mathematics 6, 382-392 (Cambridge University Press)
openalex publication_date 1954/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
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.