Given a bipartite graph G = (U u V, E), |U| < |V| , the surplus of G is defined by the maximum number such that a matching covering all vertices of U still exists upon removal of any k vertices from V. Given a partition U = {U1,...,Um} of U, the Multiple Bipartite Complete Matching Vertex Blocker Problem (MBCMVBP) consists in finding a partition V = {V1,...,Vm} of V such that the smallest surplus among those of the induced subgraphs G [Ui U Vi] is maximized. The removed vertices are related to the blocker notion. We show the strong NP-hardness of the MBCMVBP by using a reduction from the stable set problem. We also propose two integer linear programs for solving this problem. After comparing these two models, we introduce some valid inequalities for the model that outperforms the other one, and we analyze its facial structure. We then derive a Branch-and-Cut algorithm based on these results and conclude by an analysis of the experimental results.