The Farkas Lemma Revisited Published: 2009/07/07 S. S. KutateladzeCategories Convex and Nonsmooth Optimization, Linear, Cone and Semidefinite Programming Tags boolean valued model, dedekind complete vector lattice, linear inequalities, linear programming, sublinear polyhedral inequalities Short URL: https://optimization-online.org/?p=10791 The Farkas Lemma is extended to simultaneous linear operator and polyhedral sublinear operator inequalities by Boolean valued analysis. CitationSobolev Institute of Mathematics, Novosibirsk, 630090 RussiaArticleDownload View PDF