Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Lifting 기법을 이용한 Generalized Bilinear Cover InequalityGeneralized Bilinear Cover Inequality via Lifting
- Other Titles
- Generalized Bilinear Cover Inequality via Lifting
- Authors
- 정광헌
- Issue Date
- Aug-2017
- Publisher
- 한국경영과학회
- Keywords
- Mixed-Integer Programming; Bilinear inequality; Branch-and-Bound; Facet-Defining; Lifting; Subadditive
- Citation
- 한국경영과학회지, v.42, no.3, pp.1 - 12
- Journal Title
- 한국경영과학회지
- Volume
- 42
- Number
- 3
- Start Page
- 1
- End Page
- 12
- ISSN
- 1225-1119
- Abstract
- In this paper, we generalize lifted inequalities to a 0-1 mixed-integer bilinear covering set with linear terms. This work is motivated by the observation that Generalized Bilinear Inequality (GBI) occurs in the Branch and Bound process. We find some conditions and prove the subadditivity of lifting functions for lifting to be sequence- independent. Using the theoretical results, we develop facet-defining inequalities for a GBI-defined set through three steps of lifting.
- 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)