An Introduction to Redundancy

Redundancy in mathematical programming is common, being generally brought about by the lack of complete knowledge about the system of constraints and the desire on the part of the problem formulator not to omit essential elements of the formulation. Over the past twenty years numerous papers have been written on redundancy. In those papers methods have been presented for identifying redundancies. This volume presents an up-to-date survey of methods for identifying and removing redundancy and presents the results of extensive empirical tests on these methods. Based on the results of these tests, recommendations for improvements to the methods are made and some of the improvements are tested.