Boundedness Theorems for the Relaxation Method

Report

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 and answer an old open problem of quantifying the bounds as a function of the input data. Raphael Hauser was supported through grant NAL/00720/G from the Nuffield Foundation and through grant GR/M30975 from the Engineering and Physical Sciences Research Council of the UK.

Authors: Amaldi, E; Hauser, R

• Publisher: Unspecified
• Publication date: 2003-12-01