论文信息 - A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems

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

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.

A. A. Farley

[1] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[2] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[3] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .