


default search action
Mathematical Programming, Volume 34
Volume 34, Number 1, January 1986
- Gilles Gastou, Ellis L. Johnson:
Binary group and Chinese postman polyhedra. 1-33 - M. J. D. Powell:
How bad are the BFGS and DFP methods when the objective function is quadratic? 34-47 - William J. Cook:
On box totally dual integral polyhedra. 48-61 - Charles E. Blair:
Random linear programs with many variables and few constraints. 62-71 - Suvrajeet Sen, Hanif D. Sherali:
Facet inequalities from simple disjunctions in cutting plane theory. 72-83 - Stephen Schecter:
Structure of the first-order solution set for a class of nonlinear programs with parameters. 84-110 - Miranda Lundy, Alistair I. Mees:
Convergence of an annealing algorithm. 111-124
Volume 34, Number 2, March 1986
- Michel L. Balinski:
A competitive (dual) simplex method for the assignment problem. 125-141 - Patrice Marcotte:
Network design problem with congestion effects: A case of bilevel programming. 142-162 - J. Ben Rosen, Panos M. Pardalos:
Global minimization of large-scale constrained concave quadratic problems by separable programming. 163-174 - Krzysztof C. Kiwiel:
A method of linearizations for linearly constrained nonconvex nonsmooth minimization. 175-187 - Regina Hunter Mladineo:
An algorithm for finding the global maximum of a multimodal, multivariate function. 188-200 - Chia-Shin Chung:
On the stability of Invariant Capital Stock in a two-dimensional planning model. 201-211 - Daniel Granot:
A generalized linear production model: A unifying model. 212-222 - Pierre Hansen, Brigitte Jaumard, Michel Minoux:
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities. 223-231 - Jonathan M. Borwein
, Deming M. Zhuang:
On Fan's minimax theorem. 232-234 - P. W. Smith, Henry Wolkowicz:
A nonlinear equation for linear programming. 235-238 - Philip C. Jones:
Even more with the Lemke complementarity algorithm. 239-242 - Jerzy A. Filar
, Todd A. Schultz:
Nonlinear programming and stationary strategies in stochastic games. 243-247
Volume 34, Number 3, April 1986
- William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos:
Sensitivity theorems in integer linear programming. 251-264 - Richard E. Stone:
Linear complementarity problems with an invariant number of solutions. 265-291 - Yahya Fathi, Craig A. Tovey
:
Affirmative action algorithms. 292-301 - Jacqueline Boucher, Yves Smeers:
The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation. 302-332 - Hubertus Th. Jongen, P. Jonker, F. Twilt:
Critical sets in parametric optimization. 333-353 - Rainer Hettich:
An implementation of a discretization method for semi-infinite programming. 354-361 - John H. Semple, Sanjo Zlobec:
On the continuity of a Lagrangian multiplier function in input optimization. 362-369 - Donald Goldfarb:
Efficient dual simplex algorithms for the assignment problem. 372

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.