Farkas' lemma
id:
farkas-lemma-232-10010708
title:
Farkas' lemma
text:
In mathematics, Farkas' lemma is a solvability theorem for a finite system of linear inequalities. It was originally proven by the Hungarian mathematician Gyula Farkas.
Farkas' lemma is the key result underpinning the linear programming duality and has played a central role in the development of mathematical optimization. It is used amongst other things in the proof of the Karush–Kuhn–Tucker theorem in nonlinear programming.
Remarkably, in the area of the foundations of quantum theory, the lemma
brand slug:
wiki
category slug:
encyclopedia
description:
Solvability theorem for finite systems of linear inequalities
original url:
https://en.wikipedia.org/wiki/Farkas%27_lemma
date created:
date modified:
2024-01-28T12:21:02Z
main entity:
{"identifier":"Q606254","url":"https://www.wikidata.org/entity/Q606254"}
image:
fields total:
13
integrity:
14