Solving Inequalities and Proving Farkas's Lemma Made Easy

@article{Avis2004SolvingIA,
  title={Solving Inequalities and Proving Farkas's Lemma Made Easy},
  author={David Avis and Bohdan Kaluzny},
  journal={The American Mathematical Monthly},
  year={2004},
  volume={111},
  pages={152-157}
}
We present a simple algorithm that finds a nonnegative solution to a system of linear inequalities. This algorithm can be taught to secondary or college level students who have learned how to solve a system of linear equations. The algorithm is a dual version of Bland’s rule for linear programming. We present a simple proof of finiteness which leads to a simple proof of Farkas’ lemma. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Linear Programming, Freeman, New York, 1983

V. Chvátal
THE MATHEMATICAL ASSOCIATION OF AMERICA [Monthly • 1983
View 2 Excerpts

Similar Papers

Loading similar papers…