SIMPLEX ALGORITHM WITH COLUMN GENERATION FOR A CUTTING STOCK PROBLEM IN THE PAPER INDUSTRY

The cutting stock problem is a well-known combinatorial optimization problem that aims to find the best cutting piece combinations to avoid waste or gain profit while respecting constraints. This paper discusses a solution to this problem for the paper industry using the Simplex algorithm with Column Generation and the knapsack problem to discover the best cutting patterns. Experimental results show that our solution produced positive outcomes and could improve the process in paper industries.