A NOTE ON BOUNDING A CLASS OF LINEAR-PROGRAMMING PROBLEMS, INCLUDING CUTTING STOCK PROBLEMS

被引：47

作者：

FARLEY, AA

机构：

来源：

OPERATIONS RESEARCH | 1990年 / 38卷 / 05期

关键词：

D O I：

10.1287/opre.38.5.922

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：922 / 923

页数：2

共 5 条

[1] ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS
CHRISTOFIDES, N
WHITLOCK, C
[J]. OPERATIONS RESEARCH, 1977, 25 (01) : 30 - 44
[2] FARLEY AA, 1985, THESIS MONASH U MELB
[3] GALE D, 1951, ACTIVITY ANAL PRODUC, pCH19
[4] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1961, 9 (06) : 849 - 859
[5] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2.
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1963, 11 (06) : 863 - 888

← 1 →