In this paper, the algorithm to generate prime implicants presented in Ref. 5 is extended to a new algorithm. The new algorithm does not require the Boolean function to be in conjunctive normal form and is complete in the sense that it generates all the prime implicants. The author also shows that this new algorithm can be used to efficiently solve the selection problem . By using this algorithm, the original selection problem can be solved by a branch-and-bound approach which avoids an exhaustive search of the solution space and reduces the amount of necessary calculations.