Goal programming sensitivity analysis using interval penalty weights Ralph E. Steuer OriginalPaper Pages: 16 - 31
The computation of Lagrange-multiplier estimates for constrained minimization Philip E. GillWalter Murray OriginalPaper Pages: 32 - 60
Combined phase I—phase II methods of feasible directions E. PolakR. TrahanD. Q. Mayne OriginalPaper Pages: 61 - 73
A restart algorithm for computing fixed points without an extra dimension G. van der LaanA. J. J. Talman OriginalPaper Pages: 74 - 84
The number of solutions of a class of linear complementarity problems Ikuyo Kaneko Short Communication Pages: 104 - 105
Piecewise linear paths to minimize convex functions may not be monotonic Michael J. Todd Short Communication Pages: 106 - 108
Some remarks on condensation methods for geometric programs John J. DinkelGary A. Kochenberger Short Communication Pages: 109 - 113
On conditions for optimality of the nonlinearl 1 problem Christakis Charalambous OriginalPaper Pages: 123 - 135
On the number of solutions to a class of linear complementarity problems M. KojimaR. Saigal OriginalPaper Pages: 136 - 139
A multiplier method with automatic limitation of penalty growth Torkel GladElijah Polak OriginalPaper Pages: 140 - 155
Second order algorithms for the posynomial geometric programming dual, part I: Analysis R. S. Dembo OriginalPaper Pages: 156 - 175
A direct dual method for the mixed plant location problem with some side constraints Monique GuignardKurt Spielberg OriginalPaper Pages: 198 - 228
Penalty methods for computing points that satisfy second order necessary conditions A. Auslender OriginalPaper Pages: 229 - 238
On perfect graphs and polyhedra with (0, 1)-valued extreme points C. L. MonmaL. E. Trotter Jr. Short Communication Pages: 239 - 242
Exact penalty functions in nonlinear programming S. -P. HanO. L. Mangasarian OriginalPaper Pages: 251 - 269
Acceleration of the leastpth algorithm for minimax optimization with engineering applications Christakis Charalambous OriginalPaper Pages: 270 - 297
Some relationships between lagrangian and surrogate duality in integer programming Mark H. KarwanRonald L. Rardin OriginalPaper Pages: 320 - 334
Computational complexity of LCPs associated with positive definite symmetric matrices Yahya Fathi OriginalPaper Pages: 335 - 344
A o(n logn) algorithm for LP knapsacks with GUB constraints Fred GloverDarwin Klingman OriginalPaper Pages: 345 - 361
Theory and algorithms for linear multiple objective programs with zero–one variables Gabriel R. Bitran OriginalPaper Pages: 362 - 390
Updated triangular factors of the working basis in winkler's decomposition approach M. Bastian Short Communication Pages: 391 - 397
Call for papers: Second Symposium on Mathematical Programming with Data Perturbations Notice Pages: 398 - 399
On the lower semicontinuity of optimal sets in convex parametric optimization Erratum Pages: 400 - 400
