Winfried Hochst\"attler, Jaroslav Ne\v {s}et\v {r}il
Linear programming duality and morphisms

Comment.Math.Univ.Carolinae 40,3 (1999) 577-592.

Abstract:In this paper we investigate a class of problems permitting a good characterisation from the point of view of morphisms of oriented matroids. We prove several morphism-duality theorems for oriented matroids. These generalize LP-duality (in form of Farkas' Lemma) and Minty's Painting Lemma. Moreover, we characterize all morphism duality theorems, thus proving the essential unicity of Farkas' Lemma. This research helped to isolate perhaps the most natural definition of strong maps for oriented matroids.

Keywords: oriented matroids, strong maps, homomorphisms, duality
AMS Subject Classification: 05B35, 05C99, 18B99, 90C05