1. Cycling in the dual simplex algorithm
2. Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
3. , and , An Introduction to Linear Programming (John Wiley and Sons, Inc., New York, 1953).
4. and , “Computational Theory of Linear Programming. I: The Bounded Variables Problem,” ONR Research Memo. No. 10, Graduate School of Industrial Administration, Carnegie Institute of Technology, Jan. 1954.
5. Minimization of non-linear separable convex functionals