We consider the fault-tolerant facility location problem with penalties. In this problem, we replicate each client \(v_{j}\) times. Some of these replicas are connected to opened facility, while others remain unconnected and are penalized. By employing a natural LP-rounding technique, we provide a 2-approximation algorithm for this problem. In this algorithm, we balance the connection cost and penalty cost by setting thresholds.