Integer programming model for two-dimensional cutting problem of plank

摘要

Plank Cutting Problem is a classic case of the two-dimensional shearing problem, which has broad application prospects in real life. In this paper, the integer programming model in the plank cutting problem is established, and the verification calculation is carried out by the example in the practical production. Using the LINGO solution, the global optimal solution can be obtained under various constraints.