Optimization Online


On a Generalization of the Master Cyclic Group Polyhedron

Sanjeeb Dash (sanjeebd***at***us.ibm.com)
Ricardo Fukasawa (rfukasaw***at***isye.gatech.edu)
Oktay Gunluk (gunluk***at***us.ibm.com)

Abstract: We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of the polar of the nontrivial facet-defining inequalities for the MEP. This result generalizes similar results for the Master Cyclic Group Polyhedron by Gomory (1969) and for the Master Knapsack Polyhedron by Araoz (1974). Furthermore, this characterization also gives a polynomial time algorithm for separating an arbitrary point from the MEP. We describe how facet defining inequalities for the Master Cyclic Group Polyhedron can be lifted to obtain facet defining inequalities for the MEP, and also present facet defining inequalities for the MEP that cannot be obtained in such a way. Finally, we study the mixed-integer extension of the MEP and present an interpolation theorem that produces valid inequalities for general mixed integer programming problems using facets of the MEP.

Keywords: Master Cyclic Group Polyhedron, Master Knapsack Polyhedron, Master Equality Polyhedron,

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

Citation: IBM Tech. Report

Download: [PDF]

Entry Submitted: 02/28/2007
Entry Accepted: 03/01/2007
Entry Last Modified: 03/11/2008

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