Solving a two-dimensional trim-loss problem with MILP

The trim loss problem of a paper-converting company is considered using mixed integer non-linear programming and mixed integer linear programming (MILP). The resulting algorithm incorporating MILP has been found to be globally optimal in generating cutting patterns as it takes into account widths and lengths of paper rolls as well as cutting patterns and constraints in conversion.