A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
Operations Research · 1990 · Volume 38 · Issue 5
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.
Keywords
production/scheduling, cutting stock: cutting stock problems, programming, linear theory: bounding linear programming solutions
Enable JavaScript for citation tools and additional paper interactions.