The three dimensional cutting-stock problem is to maximize the total value of pieces which are smaller cubics-cut from a original cubic stock. This paper suggests a method to maximize the total value of different size cut pieces using the orthogonal non-guillotine cut technique. We first formulated a zero-one integer programming, then developed a Lagrangeon relaxation method far the problem. The solutions were given by using a brunch-end-bound technique associates with Lagrangean relaxation, which guarantees an optimal solution.