Notes on Linear Programming : Part I: The Generalized Simplex Method for Minimizing a Linear Form Under Linear Inequality Restraint.
by George B. Dantzig, Alex Orden and Philip Wolfe.
RAND Corporation, RM-1264. REv. 5 April 1954.
Abstract from the RAND website: "The first of a series of papers on the determination of optimum solutions to systems of linear inequalities. The present paper develops a theory for avoiding assumptions regarding rank of underlying matrices which has import in applications where little or nothing is known about the rank of some linear inequality system requiring solution."
Original offset sheets brass-tack bound with the original outer RAND Research Memorandum wrappers with the cut-out title display. The outer wrappers are a little worn around the cut-out window and have one tear that extends from the window to the edge of the cover (about an inch). Other than that this is a very nice, Fine, copy. $750
Comments