scientific article; zbMATH DE number 1929288
For the convex polyhedral set \(P\) defined by the system of linear equations and inequalities \[ \sum_{j=1}^n x_{ij}=a_i,\;\sum_{j=1}^n y_{lj}=b_l,\;\sum_{i=1}^mx_{ij}-\sum_{l=1}^{m_1}y_{lj}=0,\;x_{ij}\geq 0,\;y_{lj}\geq 0, \] \[ i=1,\dots,m,\;l=1,\dots,m_1,\;j=1,\dots,n, \] where \(a_i\), \(b_l\) are given positive real numbers, a dual set \(D\) is defined by the system \[ u_i+v_j\leq c_{ij},\;w_l-v_j\leq d_{lj},\;v_1=0,\;i=1,\dots,m,\;l=1,\dots,m, \;j=1,\dots,n \] for given real numbers \(c_{ij}\), \(d_{lj}\). The author describes the extreme points of \(P\) and \(D\) and the infinite edges of \(D\). For the entire collection see [Zbl 0951.00037].
- Faces of dual transportation polyhedra
- Sparse dual transportation polyhedra: Extreme points and signatures
- The convex linear combination method and the lattice duality prinicple in transport problems
- scientific article; zbMATH DE number 3904323
- Extreme points of certain transportation polytopes with fixed total sums
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708409)