Article ID: | iaor19942448 |
Country: | Netherlands |
Volume: | 61 |
Issue: | 1 |
Start Page Number: | 61 |
End Page Number: | 73 |
Publication Date: | Aug 1993 |
Journal: | Mathematical Programming (Series A) |
Authors: | Caron Richard J., Boneh Arnon, Boneh Shahar |
Consider a set of algebraic inequality constraints defining either an empty or a nonempty feasible region. It is known that each constraint can be classified as either absolutely strongly redundant, relatively strongly redundant, absolutely weakly redundant, relatively weakly redundant, or necessary. The authors show that it is worth making a distinction between weakly necessary constraints and strongly necessary constraints. They also present a