Optimization Online


Lifted Inequalities for 0−1 Mixed-Integer Bilinear Covering Sets

Kwanghun Chung(kwanghun.chung***at***uclouvain.be)
Jean-Philippe P. Richard(richard***at***ise.ufl.edu)
Mohit Tawarmalani(mtawarma***at***purdue.edu)

Abstract: In this paper, we study 0-1 mixed-integer bilinear covering sets. We derive several families of facet-defining inequalities via sequence-independent lifting techniques. We then show that these sets have polyhedral structures that are similar to those of certain fixed-charge single-node flow sets. As a result, we obtain new facet-defining inequalities for these sets that generalize well-known lifted flow cover inequalities from the integer programming literature.

Keywords: Cutting Planes, MINLP, Fixed-Charge Network Flow

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 2: Global Optimization (Theory )

Category 3: Integer Programming (Cutting Plane Approaches )

Citation: Submitted for publication, March 2011

Download: [PDF]

Entry Submitted: 03/01/2011
Entry Accepted: 03/01/2011
Entry Last Modified: 03/01/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society