Decomposition of integer programs with application to cutting stock and machine allocation [electronic resource] / Syam Sankar Menon.

Menon, Syam Sankar.
Bib ID
vtls001054871
出版項
Ann Arbor, Mich. : ProQuest Information and learning
稽核項
120 p.
電子版
附註項
數位化論文典藏聯盟
預約人數:0
全部評等: 0
沒有紀錄。
 
 
 
02227nam a2200349 a 4500
001
 
 
vtls001054871
003
 
 
VRT
005
 
 
20071225064000.0
006
 
 
m        d 
008
 
 
071225s1997    miu||||||m   |000 0|eng d
020
$a 9780591626308
035
$a (UMI)AAI9811896
035
$a (UnM)AAI9811896
039
9
$y 200712250640 $z VLOAD
040
$a UMI $b eng $c UMI
100
1
$a Menon, Syam Sankar.
245
1
0
$a Decomposition of integer programs with application to cutting stock and machine allocation $h [electronic resource] / $c Syam Sankar Menon.
260
$a Ann Arbor, Mich. : $b ProQuest Information and learning
300
$a 120 p.
500
$a Source: Dissertation Abstracts International, Volume: 58-10, Section: B, page: 5628.
500
$a Adviser: Linus Schrage.
502
$a Thesis (Ph.D.)--The University of Chicago, 1997.
520
$a A common problem encountered in paper production facilities is that of allocating customer orders to machines so as to minimize the total cost of production. It can be formulated as a dual angular integer program, with identical machines inducing symmetry. While the potential advantages of decomposing large mathematical programs into smaller sub-problems have long been recognized, the solution of decomposable integer programs remains extremely difficult. Symmetry intensifies the difficulty. This thesis first arrives at procedures to identify dual-angular structure and symmetry in a constraint matrix. It then develops approaches to solve decomposable integer programs. One approach, which works well when tight lower bounds can be obtained to the sub-problems is successfully applied to solve the problem from the paper industry. This method is of particular interest as it significantly reduces the impact of symmetry.
591
$a 數位化論文典藏聯盟 $b PQDT $c 中興大學(2001~2002)
653
$a Business Administration, General.
653
$a Engineering, Industrial.
653
$a Operations Research.
710
2
0
$a The University of Chicago.
773
0
$t ABI/INFORM Global (ProQuest) $g 58-10B.
773
0
$t Dissertation Abstracts International $g 58-10B
856
4
1
$u http://info.lib.tku.edu.tw/ebook/redirect.asp?bibid=1054871
999
$a VIRTUA00
沒有評論
摘要
A common problem encountered in paper production facilities is that of allocating customer orders to machines so as to minimize the total cost of production. It can be formulated as a dual angular integer program, with identical machines inducing symmetry. While the potential advantages of decomposing large mathematical programs into smaller sub-problems have long been recognized, the solution of decomposable integer programs remains extremely difficult. Symmetry intensifies the difficulty. This thesis first arrives at procedures to identify dual-angular structure and symmetry in a constraint matrix. It then develops approaches to solve decomposable integer programs. One approach, which works well when tight lower bounds can be obtained to the sub-problems is successfully applied to solve the problem from the paper industry. This method is of particular interest as it significantly reduces the impact of symmetry.
附註
Source: Dissertation Abstracts International, Volume: 58-10, Section: B, page: 5628.
Adviser: Linus Schrage.
Thesis (Ph.D.)--The University of Chicago, 1997.
數位化論文典藏聯盟
合著者
ISBN/ISSN
9780591626308