A step toward probabilistic analysis of simplex method convergence Alex Orden OriginalPaper Pages: 3 - 13
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts Hanif D. SheraliC. M. Shetty OriginalPaper Pages: 14 - 31
Geometry of optimality conditions and constraint qualifications: The convex case Henry Wolkowicz OriginalPaper Pages: 32 - 60
A new subdivision for computing fixed points with a homotopy algorithm G. van der LaanA. J. J. Talman OriginalPaper Pages: 78 - 91
Fitting hyperplanes by minimizing orthogonal deviations John P. NorbackJames G. Morris Short Communication Pages: 102 - 105
Eliminating extraneous edges in Greenberg's algorithm M. E. DyerL. G. Proll Short Communication Pages: 106 - 110
A note on heuristics for the traveling salesman problem Gianfranco d'Atri Short Communication Pages: 111 - 114
Characterizations of optimal scalings of matrices Uriel G. RothblumHans Schneider OriginalPaper Pages: 121 - 136
A modified reduced gradient method for a class of nondifferentiable problems W. GochetY. Smeers OriginalPaper Pages: 137 - 154
Second-order conditions for an exact penalty function T. F. ColemanA. R. Conn OriginalPaper Pages: 178 - 185
A dual method for discrete Chebychev curve fitting Ronald D. ArmstrongDavid S. Kung OriginalPaper Pages: 186 - 199
Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems O. L. Mangasarian OriginalPaper Pages: 200 - 212
Computational complexity of parametric linear programming Katta G. Murty OriginalPaper Pages: 213 - 219
Feasible direction methods for stochastic programming problems Andrzej Ruszczyński OriginalPaper Pages: 220 - 229
A note on the convergence of an algorithm for nonconvex programming problems Reiner Horst Short Communication Pages: 237 - 238
A degeneracy exploiting LU factorization for the simplex method André F. Perold OriginalPaper Pages: 239 - 254
Two stage linear programming under uncertainty with 0–1 integer first stage variables Richard D. Wollmer OriginalPaper Pages: 279 - 288
On the convexifiability of pseudoconvex C2-functions Siegfried SchaibleIsrael Zang OriginalPaper Pages: 289 - 299
A variable dimension algorithm for the linear complementarity problem Ludo Van der Heyden OriginalPaper Pages: 328 - 346
About a minimax theorem of Matthies, Strang and Christiansen J. Ch. Pomerol Short Communication Pages: 352 - 355
Call for papers: Study on matrix generation, report writing and computer-assisted analysis Notice Pages: 357 - 357
