Table Of Content

Mathematical Programming 51 (1991) 423-424 423 North-Holland Author Index Volume 51 Al-Khayyal, F.A., Necessary and sufficient conditions for the existence of complemen- tary solutions and characterizations of the matrix classes Q and Q) (2) 247-255 Alart, P. and B. Lemaire, Penalization in non-classical convex programming via variational convergence (3) 307-331 Brown, J.R., Solving knapsack sharing problems with general tradeoff functions (1) 55- 73 Cromme, L.J. and I. Diener, Fixed point theorems for discontinuous mapping (2) 257-267 Diener, I., see L.J. Cromme (2) 257-267 Eaves, B.C., A.J. Hoffman and H. Hu, Linear programming with spheres and hemi- spheres of objective vectors (1) 1 -16 Fischetti, M., Facets of two Steiner arborescence polyhedra (3) 401-419 Freund, R.M., Polynomial-time algorithms for linear programming based only on primal (2) 203-222 scaling and projected gradients of a potential function Geer, S. van de and L. Stougie, On rates of convergence and asymptotic normality in (3) 349-358 the multiknapsack problem Goldfarb, D. and D. Xiao, A primal projective interior point method for linear (1) 17- 43 programming Griewank, A., H.Th. Jongen and M.K. Kwong, The equivalence of strict convexity and (2) 273-278 injectivity of the gradient in bounded level sets Grotschel, M. and O. Holland, Solution of large-scale symmetric travelling salesman problems (2) 141-202 Hoffman, A.J., see B.C. Eaves (1) 1- 16 Holland, O., see M. Grotschel (2) 141-202 Hu, H., see B.C. Eaves (1) 1- 16 Jongen, H.Th., see A. Griewank (2) 273-278 Kelley, C.T. and S.J. Wright, Sequential quadratic programming for certain parameter identification problems (3) 281-305 Kwong, M.K., see A. Griewank (2) 273-278 Lemaire, B., see P. Alart (3) 307-331 Luderer, B., Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem (3) 333-348 Magagnosc, D., see M. Werman (1) 133-135 Naddef, D. and G. Rinaldi, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (3) 359-400 Pang, J.S., A B-differentiable equation-based, globally and locally quadratically conver- gent algorithm for nonlinear programs, complementarity and variational inequality problems (1) 101-131 Paparrizos, K., An infeasible (exterior point) simplex algorithm for assignment problems (1) 45- 54 Rinaldi, G., see D. Naddef (3) 359-400 (3) 349-358 Stougie, L., see S. van de Geer (1) 75-100 TakahTa., ssehe iH. ,Ya be (2) 223-228 Tolle, J.W., see E.K. Yang (2) 229-245 Tuy, H., Normal conical algorithm for concave minimization over polytopes Werman, M. and D. Magagnosc, The relationship between integer and real solutions of constrained convex programming (Short communication) (1) 133-135 Wright, S.J., see C.T. Kelley (3) 281-305 Xiao, D., see D. Goldfarb (1) 17- 43 Yabe, H. and T. Takahashi, Factorized quasi-Newton methods for nonlinear least squares problems (1) 75-100 424 Author Index Yang, E.K. and J.W. Tolle, A class of methods for solving large, convex quadratic programs subject to box constraints (2) 223-228 Zaremba, L.S., Perfect graphs and norms (Short communication) (2) 269-272