  In this paper we analyse in the framework of constructive mathematics (BISH)
the validity of Farkas' lemma and related propositions, namely the Fredholm
alternative for solvability of systems of linear equations, optimality criteria
in linear programming, Stiemke's lemma and the Superhedging Duality from
mathematical finance, and von Neumann's minimax theorem with application to
constructive game theory.
