Binding constraints of an LP Problem - Ranking constraints

What is it about?

The goal of this paper is to present a method that uses a subset of the initial constraints that are considered to be essential for the optimal solution. Thus, a combination of a recently proposed proximity technique, that is based on the proximity of the coefficients of the objective function with the corresponding coefficients of the constraints and of an algorithm that is based on the weighted average of the coefficient of each constraint, takes place.

Featured Image

Why is it important?

Each one of the algorithms that are combined in this paper ranks the constraints from the most possible to be binding to the least possible. The numerical results of the proposed algorithm are tested in a collection of well-known benchmarks.