Abstract
General mathematical programming problems may contain redundant and nonbinding constraints. These are constraints, which can be removed from the problem without altering the feasible region or the optimal solution respectivily. Here we consider some more theoretical definitions and give reasons for selecting a special one. The emphasis is put on linear programming, but most of the material can be applied to any mathematical programming problem with linear constraints. To identify redundant constraints several methods have been proposed. We give a survey and show that all these methods are variants of a general method (Telgen (1977a)). No method is known to identify non-binding constraints directly; therefore we give some indirect ways to identify non-binding constraints. Finally, some remarks are made concerning the importance of the methods to identify redundant and nonbinding constraints in practical linear programming problems, both from a managerial and from a computational point of view.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
