Notes on Linear Programming
Part VII The Dual Simplex Algorithm
A procedure for solving the dual problem by means of variables associated with a basis that may have negative as well as positive values in the iterative process before an optimum is reached.
Dantzig, George Bernard, Notes on Linear Programming: Part VII The Dual Simplex Algorithm. Santa Monica, CA: RAND Corporation, 1954. https://www.rand.org/pubs/research_memoranda/RM1270.html. Also available in print form.
Dantzig, George Bernard, Notes on Linear Programming: Part VII The Dual Simplex Algorithm, Santa Monica, Calif.: RAND Corporation, RM-1270, 1954. As of August 03, 2022: https://www.rand.org/pubs/research_memoranda/RM1270.html