This paper aims to find a faster method for optimal solutions of Feng et al.’s int m –int n decision making scheme. We first give theoretical characterizations of optimal decision sets. Then we develop a pruning method which filters out those objects that cannot be elements of any optimal decision sets in the beginning. Experimental results have shown that our method has higher efficiency in computing the optimal solutions of this scheme, particularly when we are processing soft sets with a great quantity of data. 
Pruning method for optimal solutions of int m –int n decision making scheme