Optimal design of a membrane separation process using signomial programming Ron S. DemboMordecai Avriel OriginalPaper Pages: 12 - 25
A mathematical programming system for preference and compatibility maximized menu planning and scheduling Joseph L. BalintfyG. Terry RossAndris A. Zoltners OriginalPaper Pages: 63 - 76
On solving optimization problems with proportion-constraints Uriel G. Rothblum OriginalPaper Pages: 77 - 86
On equivalent representations of certain multicommodity networks as single commodity flow problems James R. Evans OriginalPaper Pages: 92 - 99
Abstract polytopes and the hirsch conjecture John A. Lawrence Jr. Short Communication Pages: 100 - 104
An alternative method for a global analysis of quadratic programs in a finite number of steps André F. Perold Short Communication Pages: 105 - 109
On a conjecture of Dixon and other topics in variable metric methods E. Spedicato OriginalPaper Pages: 123 - 129
A subgradient algorithm for certain minimax and minisum problems J. A. ChatelonD. W. HearnT. J. Lowe OriginalPaper Pages: 130 - 145
A parametric linear complementarity problem involving derivatives Ikuyo Kaneko OriginalPaper Pages: 146 - 154
A generalized knapsack problem with variable coefficients Hisatoshi Suzuki OriginalPaper Pages: 162 - 176
Using cutting planes to solve the symmetric Travelling Salesman problem P. Miliotis OriginalPaper Pages: 177 - 188
A quasi-Newton method can be obtained from a method of conjugate directions Michael J. Best OriginalPaper Pages: 189 - 199
A combined conjugate-gradient quasi-Newton minimization algorithm A. G. Buckley OriginalPaper Pages: 200 - 210
A continuous variable representation of the traveling salesman problem Joseph A. Svestka Short Communication Pages: 211 - 213
More with the Lemke complementarity algorithm Joseph J. M. Evers Short Communication Pages: 214 - 219
A note on ‘monotone optimal policies for markov decision processes’ Dieter Kalin Short Communication Pages: 220 - 222
The Held—Karp algorithm and degree-constrained minimum 1-trees Y. Yamamoto Short Communication Pages: 228 - 231
Solution of the linear inverse vector optimization problem by a single linear program O. L. MangasarianW. R. S. Sutherland Short Communication Pages: 232 - 235
A note on ‘new algorithms for constrained minimax optimization’ T. F. Coleman Short Communication Pages: 239 - 242
Optimal conditioning in the convex class of rank two updates Robert B. Schnabel OriginalPaper Pages: 247 - 260
An implementation of some implicit function theorems with applications to sensitivity analysis J. J. DinkelG. A. Kochenberger OriginalPaper Pages: 261 - 267
A lower bound for the controlling parameters of the exact penalty functions Christakis Charalambous OriginalPaper Pages: 278 - 290
Reporting computational experiments in mathematical programming Harlan P. CrowderRon S. DemboJohn M. Mulvey OriginalPaper Pages: 316 - 329
Progressive global random search of continuous functions Luc P. Devroye OriginalPaper Pages: 330 - 342
Extending the relationship between the conjugate gradient and BFGS algorithms A. Buckley Short Communication Pages: 343 - 348
A note on Schrage's generalised variable upper bounds R. C. Daniel Short Communication Pages: 349 - 351
Some experiments with the pathological linear programs of N. Zadeh William P. NiedringhausKenneth Steiglitz Short Communication Pages: 352 - 354
Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems Patrick G. McKeown Short Communication Pages: 355 - 359
