Hi. I have a problem. I am using simplex and MIP classes in Cutting Stock Problem but it doesn't use all the possibilities.
We know that the INPUT data of the Cutting Stock Problem in divided in - What we need (pieces we have to cut or result pieces) - What we have or Stock (commercial lengths or retail pieces of previous cuts) For example, if I have 6 comercial lengths of 600 cms, 3 of 300 cms, and a retail piece of 170 cms and I insert them in my model or the matrix in the following way... 600,300,170,600,300,600,300,600,600,600, it consumes or cut the comercial pieces in order and does not iterate in all the comercial lengths not guaranting the best way of minimizing left over or retail pieces. In other words, if my model is wright, it has to give me the same results no matter the insertion order and this is not happening. It works with only one comercial length, but it is not fulfilling my requirements. Any advise? Congratulations, I love glpk.jar. Thank you.
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
