1D Optimal Cut

An Integer Linear Programming model is generated and solved with its own algorithms. In addition, the theory for the solution of the problem and an application example are explained.

The available model options are:
- Minimize waste
- Minimize units to cut
- Constraints greater equal (> =)
- Equalities (=)

The application includes dark mode and landscape orientation.