This algorithm solves linear programmes by an iterative process which may be likened to a moving point which rebounds off the interior faces of the polytope. The talk will include an analysis of the effectiveness of this algorithm in comparison with established methods.