A finite crisscross method for oriented matroids (Q1073036): Difference between revisions

Our paper presents a finite criss-cross method for oriented matroids. Starting from a neither primal nor dual feasible tableau, we reach primal and dual optimal oriented circuits in finite number of steps if they exist. If there is no optimal tableau then we show that there is no primal feasible circuit or there is no dual feasible cocircuit. So we give a new constructive proof for the general duality theorem [\textit{R. G. Bland}, J. Comb. Theory, Ser. B 23, 33-57 (1977; Zbl 0375.90046), \textit{J. Folkman} and \textit{J. Lawrence}, J. Comb. Theory, Ser. B 25, 199-236 (1978; Zbl 0325.05019)]. Our pivot rule is a generalization of the anty cycling rule suggested by Bland [loc. cit.].