In this paper we present a Lagrangian relaxation approach for solving the capacitated plant location problem with side constraints. The side constraints are upper bound constraints on disjoint subsets of the (0-1) variables. We also provide an application where this procedure can be used to solve a particular vehicle Routing Problem. Computational results are provide for some problems both on the main frame computer as well as the personal computer.