The basic problem of linear programming is to minimize (or maximize) a linear function of a finite number of variables constrained by a finite number of linear inequalities. From a mathematical point of view the subject may be regarded as being divided into two areas. One is primarily analytical and deals with certain questions of duality and consistency. The other is algorithmic and is concerned with computational questions and methods.
No takes yet. Share an insight, caveat, or question.
K. S. Kretschmer (1961) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: