An Linear Programming Approach for the cutting stock problem

• Grant number: 24/17632-4
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: January 01, 2025
• End date: December 31, 2025
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Aurelio Ribeiro Leite de Oliveira
• Grantee: Bruno Block Valente
• Host Institution: Instituto de Matemática, Estatística e Computação Científica (IMECC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

Abstract

This project means to investigate the Gilmore and Gomory method application in order to solve the unidimensional cutting problem modeled as a continuous linear programming problem, generating several cutting patterns simultaneously, getting an integer problem solved by branch-and-bound. We will perform a comparison with the original results obtained by Gilmore and Gomory and in more recent papers. The optimality verification may be easily don using a unidimensional cutting model in graphs.