research

Partitions of the polytope of Doubly Substochastic Matrices

Abstract

In this paper, we provide three different ways to partition the polytope of doubly substochastic matrices into subpolytopes via the prescribed row and column sums, the sum of all elements and the sub-defect respectively. Then we characterize the extreme points of each type of convex subpolytopes. The relations of the extreme points of the subpolytopes in the three partitions are also given

    Similar works

    Full text

    thumbnail-image

    Available Versions