Relaxation Method for Linear Programs with Side Constraints

We propose a new method for solving linear programs with side constraints. This method extends those proposed in [2] and [15] and uses decomposition to exploit special structures in the side constraints. Application to network flow problems with side constraints is discussed.