An Iterative Method for Solving Linear Inequalities
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T20:59:05Z | |
| dc.date.available | 2004-05-31T20:59:05Z | |
| dc.date.created | 1987-04 | en_US |
| dc.date.issued | 1995-02-06 | en_US |
| dc.description.abstract | This paper describes and analyzes a method for finding nontrivial solutions of the inequality $Ax \geq 0$, where $A$ is an $m \times n$ matrix of rank $n$. The method is based on the observation that a certain function $f$ has a unique minimum if and only if the inequality {\it fails to have} a nontrivial solution. Moreover, if there is a solution, an attempt to minimize $f$ will produce a sequence that will diverge in a direction that converges to a solution of the inequality. The technique can also be used to solve inhomogeneous inequalities and hence linear programming problems, although no claims are made about competitiveness with existing methods. | en_US |
| dc.format.extent | 168101 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/355 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | Computer Science Department Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-1833 | en_US |
| dc.title | An Iterative Method for Solving Linear Inequalities | en_US |
| dc.type | Technical Report | en_US |