Research Article
A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems
Table 8
Comparison of five methods: netlib problems.
| S. no. and File name | Size of the problem | Number of redundant constraints identified by | No. of constraints | No. of variables | Brearly’s method | Linear programming method | Deterministic method | Stojković- Stanimirović method | Heuristic method |
| (1) afiro | 20 | 20 | 9 | 3 | 0 | 0 | 4 | (2) fit1d | 24 | 24 | 2 | 10 | 0 | 0 | 13 | (3) fit2d | 25 | 25 | 0 | 19 | 0 | 7 | 19 | (4) sc50b | 28 | 28 | 0 | 7 | 0 | 0 | 10 | (5) sc50a | 29 | 29 | 1 | 11 | 0 | 2 | 11 | (6) kb2 | 39 | 39 | 3 | 13 | 0 | 14 | 14 | (7) vtpbase | 51 | 51 | 1 | 21 | 0 | 4 | 30 | (8) bore3d | 52 | 52 | 42 | 17 | 0 | 22 | 18 |
|
|