Boundedness Theorems for the Relaxation Method
A classical theorem by Block and Levin says that certain variants of the relaxation method for solving systems of linear inequalities produce bounded sequences of intermediate solutions even when running on inconsistent input data. Using a new approach, we prove a more general version of this result...
| Main Authors: | , |
|---|---|
| Format: | Report |
| Published: |
Unspecified
2003
|