Constraint classification in mathematical programming |
| |
Authors: | Arnon Boneh Shahar Boneh Richard J Caron |
| |
Institution: | (1) Technion — The Israel Institute of Technology, Haifa, Israel;(2) Wichita State University, Wichita, KA, USA;(3) Department of Mathematics and Statistics, University of Windsor, 401 Sunset, N9B 3P4 Windsor, Ont., Canada |
| |
Abstract: | 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. We show that is is worth making a distinction between weakly necessary constraints and strongly necessary constraints. We also present afeasible set cover method which can detect both weakly and strongly necessary constraints.The main interest in constraint classification is due to the advantages gained by the removal of redundant constraints. Since classification errors are likely to occur, we examine how the removal of a single constraint can affect the classification of the remaining constraints. |
| |
Keywords: | Constraint classification redundant constraints necessary constraints infeasible sets hit-and-run feasible set covers |
本文献已被 SpringerLink 等数据库收录! |
|