A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems

Publisher Website
Google Scholar
Abstract
In LP problems with an extremely large number of possible structural variables, solution to optimality is not always required. A bound can be used to terminate such LPs. Such a bound is presented for a class of problem that includes most cutting stock formulations.