This program will try to find optimal solutions for what is commonly known as the 1-dimensional Cutting Stock Problem, The Cutting Stock problem requires that we find the best (cheapest) way to cut one-dimensional stock pieces (pipe, dimensional lumb