In this paper we deal with the stabilizability property for discrete-time switched linear systems. A recent necessary and sufficient characterization of stabilizability, based on set theory, is considered as the reference for comparing the computation-oriented sufficient conditions. The classical BMI conditions based on Lyapunov-Metzler inequalities are considered and extended. Novel LMI conditions for stabilizability, derived from the geometric ones, are presented that permit to combine generality with computational affordability. For the different conditions, the geometrical interpretations are provided and the induced stabilizing switching laws are given. The relations and the implications between the stabilizability conditions are analyzed to infer and compare their conservatism and their complexity.