Abstract
This paper gives an alternative, unified development of the primal and dual simplex methods for maximizing
c
T
x subject to
A
x
=
b
,
x
⩾0.
The calculations are described in terms of certain canonical bases for the null space of
A and the range space of
A
T
. The vectors of these bases are edges of the polyhedron in question at the given basic feasible solution.