Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
0-1 Mixed-Integer Bilinear Covering Sets에 대한 Lifted Bilinear Cover Inequalities의 SeparationSeparation of Lifted Bilinear Cover Inequalitiesfor 0-1 Mixed-Integer Bilinear Covering Set
- Other Titles
- Separation of Lifted Bilinear Cover Inequalitiesfor 0-1 Mixed-Integer Bilinear Covering Set
- Authors
- 정광헌
- Issue Date
- Feb-2019
- Publisher
- 한국경영과학회
- Keywords
- Mixed-Integer Programming(MIP); Bilinear inequality; Lifting; Separation; Cut-and-Branch
- Citation
- 한국경영과학회지, v.44, no.1, pp.31 - 42
- Journal Title
- 한국경영과학회지
- Volume
- 44
- Number
- 1
- Start Page
- 31
- End Page
- 42
- ISSN
- 1225-1119
- Abstract
- In this paper, we consider a computational study to evaluate the strength of Lifted Bilinear Cover (LBC) inequality for 0-1 Mixed-Integer Bilinear Covering Set. In particular, we develop a separation algorithm for LBC inequality to find the most violated cut by solving a simple optimization problem. After testing a separation algorithm on randomly generated instances, we provide numerical results that show LBC inequalities can help solve a bilinear optimization problem faster.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Chung, Kwanghun
- Business Administration (Business Administration)