| Size of the problem | No. of binding constraints and which constraints are binding (in the parentheses) identified by: | |||||
Example no. | Simplex method | The proposed algorithm | |||||
No. of constraints | No. of variables | Total no. of binding constraints | No. of binding constraints without duplicates | ||||
1 | 4 | 3 | 3 (1,2,4) | 3 (1,2,4) | 3 (1,2,4) | ||
2 | 4 | 3 | 2 (1,2) | 3 (1,2,1) | 2 (1,2) | ||
3 | 5 | 3 | 2 (1,2) | 3 (2,1,1) | 2 (2,1) | ||
4 | 4 | 3 | 2 (2,3) | 3 (2,2,3) | 2 (2,3) | ||
5 | 4 | 3 | 2 (3,4) | 3 (4,3,3) | 2 (4,3) | ||
6 | 4 | 3 | 2 (2,3) | 3 (2,2,3) | 2 (2,3) | ||
7 | 4 | 3 | 2 (3,4) | 3 (4,4,3) | 2 (4,3) | ||
8 | 4 | 3 | 2 (1,2,3) | 3 (2,1,3) | 2 (2,1,3) | ||
9 | 5 | 4 | 3 (1,4,5) | 4 (4,1,5,1) | 3 (4,1,5) | ||
10 | 9 | 6 | 3 (1,2,3) | 6 (3,3,2,1,2,2) | 3 (3,2,1) | ||
11 [25] a | 4 | 5 | 2 (1,4) | 5 (1,1,1,1,4) | 2 (1,4) | ||