Interval arithmetic for guaranteed bounds in linear programming

In this note, we show how interval arithmetic can be used to give a solution to the linear programming problem which is guaranteed to be on the safe side of the true solution, where roundoff error is taken into account.