English

Extreme points of general transportation polytopes

Combinatorics 2024-04-26 v1

Abstract

Transportation matrices are m×nm\times n non-negative matrices whose row sums and row columns are equal to, or dominated above with given integral vectors RR and CC. Those matrices belong to a convex polytope whose extreme points have been previously characterized. In this article, a more general set of non-negative transportation matrices is considered, whose row sums are bounded by two integral non-negative vectors RminR_{min} and RmaxR_{max} and column sums are bounded by two integral non-negative vectors CminC_{min} and CmaxC_{max}. It is shown that this set is also a convex polytope whose extreme points are then fully characterized.

Keywords

Cite

@article{arxiv.2404.16791,
  title  = {Extreme points of general transportation polytopes},
  author = {Patrice Koehl},
  journal= {arXiv preprint arXiv:2404.16791},
  year   = {2024}
}

Comments

10 pages