We propose a new solution for a class of nonconvex programs involving l ₀ norm. Our method is based on a reformulation of these programs as bilevel programs, in which the objective function in the first level program is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a linear programming problem. Exact penalty techniques are then used to reformulate the obtained programs as DC programs. The resulted problems are then handled by the local algorithm DCA in DC programming. Preliminary computational results are reported.