Constrained Infinite Group Relaxations of MIPs
Santanu Dey (santanu.deyuclouvain.be)
Abstract: Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to this stronger relaxation and characterize the extreme inequalities when there are two integer variables.
Keywords: Mixed Integer Programming, Cutting Planes, Group Relaxation
Category 1: Integer Programming
Category 2: Integer Programming ((Mixed) Integer Linear Programming )
Category 3: Integer Programming (Cutting Plane Approaches )
Citation: To appear in SIAM journal on Optimization.
Entry Submitted: 05/14/2009
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|