In　this　paper,　we　consider　the　robust　facility　location　problem　with　penalties,　aiming　to　serve　only　a　specified　fraction　of　the　clients.　We　formulate　this　problem　as　an　integer　linear　program　to　identify　which　clients　must　be　served.　Based　on　the　corresponding　LP　relaxation　and　dual　program,　we　propose　a　primal–dual　(combinatorial)　3-approximation　algorithm.　Combining　the　greedy　augmentation　procedure,　we　further　improve　the　above　approximation　ratio　to　2.　©　2014,　Springer　Science+Business　Media　New　York.