A simple proof of the generalized farkas lemma for oriented matroids

L. Balogh, T. Illes, F. Erbilen

Research output: Contribution to journalArticle

Abstract

In this note we consider the feasibility problem of oriented matroids. An alternative
theorem, which is a generalization of Farkas’ famous result, is stated and proved. Our proof is constructive and new. In the proof of the generalized Farkas lemma, the finiteness of a criss-cross type algorithm is used. The algorithm’s pivot rule, for criss-cross type methods, first was used by S. Zhang for linear programming problems.
Original languageEnglish
Pages (from-to)423-431
Number of pages9
JournalPure Mathematics and Applications
Volume13
Issue number4
Publication statusPublished - 1 Dec 2002

Keywords

  • matroids
  • oriented matroids
  • feasibility problem of oriented matroids
  • criss-cross type algorithm

Fingerprint Dive into the research topics of 'A simple proof of the generalized farkas lemma for oriented matroids'. Together they form a unique fingerprint.

Cite this