In this paper we study a general Attack-Defense gaming case of the R-Interdiction Median problem with Fortification (AD-RIMF in short), which is very important for critical infrastructures/facilities protection in many fields. A bi-objective mathematical model is presented to describe the gaming process of the AD-RIMF problem by considering expectations from both designer and attacker who pursue the same cost objective function but in the opposite direction. We give some theoretical analysis on the optimal solution of the AD-RIMF problem, and propose a general solution approach. Computational test is done to illustrate the proposed model and solution approach.