Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T20:34:22.562Z Has data issue: false hasContentIssue false

The Relaxation Method for Linear Inequalities

Published online by Cambridge University Press:  20 November 2018

Shmuel Agmon*
Affiliation:
The Rice Institute, Houston, Texas, University of California at Los Angeles; National Bureau of Standards at Los Angeles, The Hebrew University, Jerusalem
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1954