Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An elementary proof of linear programming optimality conditions without
  using Farkas' lemma   Although it is easy to prove the sufficient conditions for optimality of a
linear program, the necessary conditions pose a pedagogical challenge. A
widespread practice in deriving the necessary conditions is to invoke Farkas'
lemma, but proofs of Farkas' lemma typically involve "nonlinear" topics such as
separating hyperplanes between disjoint convex sets, or else more advanced
LP-related material such as duality and anti-cycling strategies in the simplex
method. An alternative approach taken previously by several authors is to avoid
Farkas' lemma through a direct proof of the necessary conditions. In that
spirit, this paper presents what we believe to be an "elementary" proof of the
necessary conditions that does not rely on Farkas' lemma and is independent of
the simplex method, relying only on linear algebra and a perturbation technique
published in 1952 by Charnes. No claim is made that the results are new, but we
hope that the proofs may be useful for those who teach linear programming.

27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
4
The categories of this paper are: cond-mat
28
The categories of this paper are: alg-geom
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
0
The categories of this paper are: hep-ph
12
The categories of this paper are: nucl-th