Journal: Math. Program.

Volume 34, Issue 3

251 -- 264William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos. Sensitivity theorems in integer linear programming
265 -- 291Richard E. Stone. Linear complementarity problems with an invariant number of solutions
292 -- 301Yahya Fathi, Craig A. Tovey. Affirmative action algorithms
302 -- 332Jacqueline Boucher, Yves Smeers. The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation
333 -- 353Hubertus Th. Jongen, P. Jonker, F. Twilt. Critical sets in parametric optimization
354 -- 361Rainer Hettich. An implementation of a discretization method for semi-infinite programming
362 -- 369J. Semple, Sanjo Zlobec. On the continuity of a Lagrangian multiplier function in input optimization
372 -- 0Donald Goldfarb. Efficient dual simplex algorithms for the assignment problem

Volume 34, Issue 2

125 -- 141Michel L. Balinski. A competitive (dual) simplex method for the assignment problem
142 -- 162Patrice Marcotte. Network design problem with congestion effects: A case of bilevel programming
163 -- 174J. Ben Rosen, Panos M. Pardalos. Global minimization of large-scale constrained concave quadratic problems by separable programming
175 -- 187Krzysztof C. Kiwiel. A method of linearizations for linearly constrained nonconvex nonsmooth minimization
188 -- 200Regina Hunter Mladineo. An algorithm for finding the global maximum of a multimodal, multivariate function
201 -- 211Chia-Shin Chung. On the stability of Invariant Capital Stock in a two-dimensional planning model
212 -- 222Daniel Granot. A generalized linear production model: A unifying model
223 -- 231Pierre Hansen, Brigitte Jaumard, Michel Minoux. A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
232 -- 234Jonathan M. Borwein, D. Zhuang. On Fan's minimax theorem
235 -- 238P. W. Smith, Henry Wolkowicz. A nonlinear equation for linear programming
239 -- 242Philip C. Jones. Even more with the Lemke complementarity algorithm
243 -- 247Jerzy A. Filar, Todd A. Schultz. Nonlinear programming and stationary strategies in stochastic games

Volume 34, Issue 1

1 -- 33Gilles Gastou, Ellis L. Johnson. Binary group and Chinese postman polyhedra
34 -- 47M. J. D. Powell. How bad are the BFGS and DFP methods when the objective function is quadratic?
48 -- 61William J. Cook. On box totally dual integral polyhedra
62 -- 71Charles Blair. Random linear programs with many variables and few constraints
72 -- 83Suvrajeet Sen, Hanif D. Sherali. Facet inequalities from simple disjunctions in cutting plane theory
84 -- 110Stephen Schecter. Structure of the first-order solution set for a class of nonlinear programs with parameters
111 -- 124Miranda Lundy, Alistair I. Mees. Convergence of an annealing algorithm