Summary: In literature, single/multistage warehouse location problems have been attempted by A. M. Geoffrion and G. W. Graves [Manage. Sci., Theory 2, 82–114 (1974; Zbl 0304.90122)] and R. R. K. Sharma [Eur. J. Oper. Res. 51, No. 1, 24–34 (1991; Zbl 0734.90054)] among others and they have given completely different formulations. We use the formulation style given by R. R. K. Sharma and K. D. Sharma [Eur. J. Oper. Res. 122, No. 3, 611–624 (2000; Zbl 0961.90065)] to develop variety of constraints that link real and 0–1 integer variables; thus developing many formulations of single stage capacitated warehouse location problem (SSCWLP). We relax the integer constraints on 0–1 variables to obtain their relaxations. Later we conduct an empirical investigation to find that there exist relaxations which give better bounds than the ‘strong’ relaxation of SSCWLP. We also find that SSCWLP when formulated using the style due toR. R. K. Sharma [loc. cit.] takes significantly less computational time for optimal solution compared to the time taken to reach optimality for the SSCWLP problems when formulated using the style due to Geoffrion and Graves [loc. cit.]. Finally we conducted an experimental investigation on 100 problems of SSCWLP problems each of sizes \(25 \times 25 \times 25, 50 \times 50 \times 50\) and \(100 \times 100 \times 100\) and this establishes that the effectiveness of ‘capacity’ constraints proposed in this paper is particularly strong.