A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems

Table 9

Comparison of five methods: Large Size Problems.

S. no. and File name	Size of the problems		Number of redundant constraints identified by
	No. of constraints	No. of variables	Brearly method	Linear programming method	Deterministic method	Stojković Stanimirović method	Heuristic method
(1) scpcyc06	240	192	197	235	201	0	236
(2) scpe2	50	500	31	40	38	0	43
(3) scp43	200	1000	142	195	136	143	196
(4) scp52	200	2000	187	197	163	98	198
(5) scpa3	300	3000	165	181	123	93	293
(6) scpd3	400	4000	243	305	315	64	395
(7) scpcyc08	1792	1024	800	1512	1328	54	1780
(8) scpc1r13	4095	715	1023	3608	3204	0	4083