Notes on Linear Programming — Part III: Computational Algorithm of the Revised Simplex Method

An extension of RM-1264 and RM-1265, Parts I and II, respectively, of Notes on Linear Programming. The present study presents the computational procedure.

Notes on Linear Programming: Part V Alternate Algorithm for the Revised Simplex Method Using a Product Form for the Inverse

A description of a finite iterative procedure, using a product form for the inverse. See also RM-1268/1.

Notes on Parametric Linear Programming.

On a New Iterative Algorithm for Finding the Solutions of Games and Linear Programming Problems.

A discussion of an iterative procedure which yields the value of a game very rapidly. 15 pp....

Some Results in Non-Linear Programming

A solution to a minimization problem which is used to treat a class of maximization problems. Possible applications of the results are discussed.

On Some Dynamic Linear Programming Problems.

The Le Chatelier Principle in Linear Programming

An extended study of the Le Chatelier principle which determines a cheapest diet conforming to prescribed nutritional standards.