Some methods for identifying redundant constraints in linear programming

Abstract

Linear programming problems consist of two parts are objective function and inequality constraints. A redundant constraint is a constraint that does not change the feasible region. There are many methods for detecting redundant constraint. The methods for identifying redundant constraints which in the process only uses the objective function and inequality constraints, among others, Heuristic method, Llewellyn method, and Stojkovic-Stanimirovic methods. Heuristic method cannot identify weakly redundant constraints as redundant constraints. Llewellyn method comparing two constraints. Stojkovic-Stanimirovic depend on objective function. In this paper, we give some examples to recognize characteristics of these methods.