Total dual dyadicness and dyadic generating sets (Q2164668)

This article considers totally dyadic linear systems, which are those having integer coefficients with optimal solution vector with entries of the form \(a/2^k\). The authors consider the problem of determining when a linear program admits an optimal dyadic solution via the use of dyadic generating sets. Several interesting results are proven which provide a better insight on polyhedral internality. An extension to \(T\)-joins and perfect matchings concludes this paper. For the entire collection see [Zbl 1492.90008].