  


nstep MIR Functions: Facets for Finite and Infinite Group Problems
Kiavash Kianfar (kkianfancsu.edu) Abstract: The nstep mixed integer rounding (MIR) functions are used to generate nstep MIR inequalities for (mixed) integer programming problems (Kianfar and Fathi, 2006). We show that these functions are sources for generating extreme valid inequalities (facets) for group problems. We first prove the nstep MIR function, for any positive integer n, generates twoslope facets for the infinite group problem, and then show under appropriate conditions on parameters, these functions also generate facets for the finite master cyclic group problem. We discuss that similar results are true for the group problems with continuous variables. Keywords: Mixed Integer Rounding; Group Problem; Corner Polyhedron; Facet; Mixed Integer Programming Category 1: Integer Programming ((Mixed) Integer Linear Programming ) Category 2: Integer Programming (Cutting Plane Approaches ) Citation: Operations Research Technical Report 20062, North Carolina State University Download: Entry Submitted: 09/25/2006 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  