Faces of dual transportation polyhedra

DOI10.1007/BFb0121004zbMath0553.90066MaRDI QIDQ3216429

Michel Balinski, Andrew Russakoff

Publication date: 1984

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

polyhedrafacesdual transportation polytopemaximum number of extreme points

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Polytopes and polyhedra (52Bxx)

Related Items

A competitive (dual) simplex method for the assignment problem, A distributionally robust optimization approach for two-stage facility location problems, Sparse dual transportation polyhedra: Extreme points and signatures, A relaxation column signature method for assignment problems, Fenchel-type duality for matroid valuations, Combinatoric classes of the transportation problem and their properties, Multiparametric demand transportation problem