The Farkas Lemma Revisited

Published: 2009/07/07

S. S. Kutateladze

Convex and Nonsmooth Optimization, Linear, Cone and Semidefinite Programming 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.

Citation

Sobolev Institute of Mathematics, Novosibirsk, 630090 Russia

Article

View The Farkas Lemma Revisited