Simple computable bounds for solutions of linear complementarity problems and linear programs -- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm -- The use of hypothetical points in numerical optimization -- On the quadratic programming algorithm of Goldfarb and Idnani -- A generalized Benders decomposition approach to reactive source planning in power systems -- Minimizing a unimodal function of two integer variables -- Existence and characterization of minima of concave functions on unbounded convex sets -- Using deep cuts in an ellipsoid algorithm for nonlinear programming -- On the principle of monotone likelihood and log-linear models -- Line-sum-symmetric scalings of square nonnegative matrices -- Forest iteration method for stochastic transportation problem -- Critical path planning under uncertainty