Abstract Let A be a rational ( m × n )-matrix and b be a rational m -vector. The linear system Ax ≤ b is said to be totally dual integral (TDI) if for all integer n -vectors c , the linear program min{ b t y : A t y = c ; y ≥0} has an integer-valued optimum solution if it has an optimum solution. The contents of this paper can be divided into three parts: First of all an attempt is made to characterize special classes of TDI systems. These TDI systems are classified on the basis of existence of totally unimodular active matrix sets of specific types. Secondly, a composition scheme for generating TDI systems is considered. This contains as a special case the Edmonds-Giles system. The power of this scheme is fully exploited. Finally a new TDI system is introduced which contains as special cases certain interesting old and new TDI systems.
[1]
J. Edmonds,et al.
A Min-Max Relation for Submodular Functions on Graphs
,
1977
.
[2]
László Lovász,et al.
On two minimax theorems in graph
,
1976,
J. Comb. Theory, Ser. B.
[3]
I. Mazin,et al.
Theory
,
1934
.
[4]
D. R. Fulkerson,et al.
Blocking and anti-blocking pairs of polyhedra
,
1971,
Math. Program..
[5]
Alan J. Hoffman,et al.
A generalization of max flow—min cut
,
1974,
Math. Program..
[6]
D. R. Fulkerson,et al.
Anti-blocking polyhedra
,
1972
.