The Structure of Integer Programs under the Hermitian Normal Form

V. Joseph Bowman
Additional contact information
V. Joseph Bowman: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1974, vol. 22, issue 5, 1067-1080

Abstract: This paper discusses the structure of integer programming under the Hermitian normal form. It shows that this formulation is akin to the simplex technique for linear programming in that there is a basis and a basic solution associated with each Hermitian normal matrix, and that this Hermitian basis forms a set of natural cutting planes; these cutting planes are strong in that they provide facets for at least one of the corner polyhedra associated with a linear programming basis B . In addition, the cofactors of the Hermitian basis are group elements under a homomorphism of the original group structure. The Hermitian basis also allows one to characterize the values of the right-hand side for which the present solution is feasible. Finally, for an optimal Hermitian basis, one can perform sensitivity analysis on the cost coefficients.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.5.1067 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:22:y:1974:i:5:p:1067-1080

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().