C. E. Blair

1949

• Approximate fixed points in rectangular arrays
• Axioms and examples related to ordinal dynamic programming
• Computational complexity of some problems in parametric discrete programming
• Constructive characterizations of the value function of a mixed-integer program
• Convex optimization and Lagrange multipliers
• Every finite distributive lattice is a set of stable matchings
• Some linear programs requiring many pivots
• Stable matching with multiple partners and lattice structure