With the contribution of Sharma and Muralidhar (2009) to problem Simple Plant Location Problem (SPLP), we now have two weak formulations and a strong formulation. It is noted that the total number of constraints in the weak formulation is linear, whereas few constraints in the strong formulation are quadratic in nature. Hence relaxed weak formulations give the inferior bound but with lesser time compared to the strong formulation of SPLP. Many researchers observed that this computational advantage of the weak formulation is significant for smaller sized problems however for large sized problems bound provided by it is poor. Hence hybrid formulations are proposed by many. We propose the similar model s for capacitated plant location problem (CPLP). We modify the Sharma and Muralidhar (2009) weak formulations and add to them only the most promising strong constraints to have advantages of both. Here in this paper, we introduce an additional constraint that the number of plants located is less than ‘n’ or greater than ‘n+1’and hope that this will lead to significantly better LP relaxation bounds (we hope that this will be dependent on the value of ‘n’). And also we open all plants and compute transportation cost (min_TrC) and add it in the formulation of CPLP to speed up computational