Article ID: | iaor19911570 |
Country: | United States |
Volume: | 38 |
Issue: | 5 |
Start Page Number: | 922 |
End Page Number: | 923 |
Publication Date: | Sep 1990 |
Journal: | Operations Research |
Authors: | Farley A.A. |
Keywords: | programming: linear |
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.