Optimization Online


The Farkas Lemma Revisited

S.S. Kutateladze(sskut***at***math.nsc.ru)

Abstract: The Farkas Lemma is extended to simultaneous linear operator and polyhedral sublinear operator inequalities by Boolean valued analysis.

Keywords: Dedekind complete vector lattice, linear programming, linear inequalities, sublinear polyhedral inequalities, Boolean valued model

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Convex and Nonsmooth Optimization

Citation: Sobolev Institute of Mathematics, Novosibirsk, 630090 Russia

Download: [PDF]

Entry Submitted: 07/07/2009
Entry Accepted: 07/07/2009
Entry Last Modified: 07/07/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society