Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms Stephen M. Robinson OriginalPaper Pages: 1 - 16
Minimality and complementarity properties associated with Z-functions and M-functions Arie Tamir OriginalPaper Pages: 17 - 31
The travelling salesman problem and a class of polyhedra of diameter two Manfred W. PadbergM. R. Rao OriginalPaper Pages: 32 - 45
A monotonic passy-like algorithm for the modular design problem Yves Smeers OriginalPaper Pages: 46 - 59
An improved version of the out-of-kilter method and a comparative study of computer codes R. S. BarrF. GloverD. Klingman OriginalPaper Pages: 60 - 86
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem Keld Helbig HansenJakob Krarup OriginalPaper Pages: 87 - 96
Optimal flows in networks with multiple sources and sinks Nimrod Megiddo OriginalPaper Pages: 97 - 107
On decision rules in stochastic programming Stanley J. GarstkaRoger J. -B. Wets OriginalPaper Pages: 117 - 143
Various definitions of the derivative in mathematical programming H. MassamS. Zlobec OriginalPaper Pages: 144 - 161
A numerical method for a class of continuous concave programming problems J. AbrhamL. S. Luboobi OriginalPaper Pages: 162 - 180
An approach to the numerical solutions of geometric programs John J. DinkelGary A. KochenbergerBruce McCarl OriginalPaper Pages: 181 - 190
Implementation and efficiency of Moore-algorithms for the shortest route problem U. Pape OriginalPaper Pages: 212 - 222
On the existence of optimal solutions to integer and mixed-integer programming problems R. R. Meyer OriginalPaper Pages: 223 - 235
Determining GUB sets via an invert agenda algorithm Harvey J. GreenbergDennis C. Rarick Short Communication Pages: 240 - 244
A cost function property for plant location problems A. M. Frieze Short Communication Pages: 245 - 248
Coefficient reduction for inequalities in 0–1 variables Gordon H. BradleyPeter L. HammerLaurence Wolsey OriginalPaper Pages: 263 - 282
A complementary variant of Lemke's method for the linear complementary problem C. van de Panne OriginalPaper Pages: 283 - 310
Newton-type methods for unconstrained and linearly constrained optimization Philip E. GillWalter Murray OriginalPaper Pages: 311 - 350
On the selection of parameters in Self Scaling Variable Metric Algorithms Shmuel S. Oren OriginalPaper Pages: 351 - 367
A “from scratch” proof of a theorem of Rockafellar and Fulkerson George J. Minty OriginalPaper Pages: 368 - 375
A bilinear programming formulation of the 3-dimensional assignment problem A. M. Frieze Short Communication Pages: 376 - 379
Note on a method of conjugate subgradients for minimizing nondifferentiable functions Philip Wolfe Short Communication Pages: 380 - 383
Note on an extension of “Davidon” methods to nondifferentiable functions Claude Lemarechal Short Communication Pages: 384 - 387
