In this paper we present a new method for solving the linear programming relaxation of the Cutting Stock Problem. The method is based on the relationship between
column generation and Lagrange relaxation. We have called our method the Hybrid Simplex Method/Subgradient Optimization Procedure. We test our procedure on
generated data sets and compare it with the classical column generation approach.