Farkas Lemma is a fundamental result in linear inequalities and convex analysis, providing a criterion for the solvability of systems of linear inequalities. It states that for a given matrix and vector , at least one of the following statements is true:
This lemma essentially establishes a duality relationship between feasible solutions of linear inequalities and the existence of certain non-negative linear combinations of the constraints. It is widely used in optimization, particularly in the context of linear programming, as it helps in determining whether a system of inequalities is consistent or not. Overall, Farkas Lemma serves as a powerful tool in both theoretical and applied mathematics, especially in economics and resource allocation problems.
Start your personalized study experience with acemate today. Sign up for free and find summaries and mock exams for your university.