On “an efficient algorithm for minimizing barrier and penalty functions” Arie Tamir Short Communication Pages: 390 - 391
Some continuous functions related to corner polyhedra, II Ralph E. GomoryEllis L. Johnson OriginalPaper Pages: 359 - 389
Quasi Newton techniques generate identical points II: The proofs of four new theorems L. C. W. Dixon OriginalPaper Pages: 345 - 358
An integer programming approach to a class of combinatorial problems E. M. L. BealeJ. A. Tomlin OriginalPaper Pages: 339 - 344
Proximate linear programming: A variable extreme point method F. J. Gould OriginalPaper Pages: 326 - 338
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs W. Oettli OriginalPaper Pages: 302 - 311
Mathematical programming problems with quasi-convex objective functions Jacques A. Ferland OriginalPaper Pages: 296 - 301
Generation of all integer points for given sets of linear inequalities J. Ch. Fiorot OriginalPaper Pages: 276 - 295
Some properties of the assignment polytope M. L. BalinskiAndrew Russakoff Short communication Pages: 257 - 258
On the maximal flow problem with real arc capacities J. Ponstein Short Communication Pages: 254 - 256
The proximity of (algebraic) geometric programming to linear programming R. J. DuffinElmor L. Peterson Short Communication Pages: 250 - 253
Polyhedral sets having a least element Richard W. CottleArthur F. Veinott Jr. OriginalPaper Pages: 238 - 249
Homotopies for computation of fixed points on unbounded regions B. Curtis EavesRomesh Saigal OriginalPaper Pages: 225 - 237
Monotone solutions of the parametric linear complementarity problem Richard W. Cottle OriginalPaper Pages: 210 - 224
Exact and approximate solutions to the multisource weber problem Robert E. KuenneRichard M. Soland OriginalPaper Pages: 193 - 209
Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions Jacques A. Ferland OriginalPaper Pages: 178 - 192
A partitioning algorithm for the multicommodity network flow problem M. D. GrigoriadisW. W. White OriginalPaper Pages: 157 - 177
A quadratically-convergent algorithm for general nonlinear programming problems Stephen M. Robinson OriginalPaper Pages: 145 - 156
Optimization of the flow through networks with gains Jean François Maurras OriginalPaper Pages: 135 - 144
Methods of conjugate directions versus quasi-Newton methods Garth P. McCormickKlaus Ritter OriginalPaper Pages: 101 - 116
Some continuous functions related to corner polyhedra Ralph E. GomoryEllis L. Johnson OriginalPaper Pages: 23 - 85
Quasi-newton algorithms generate identical points L. C. W. Dixon Short Communications Pages: 383 - 387
Integer programming and convex analysis: Intersection cuts from outer polars Egon Balas OriginalPaper Pages: 330 - 382
On using equality-constraint algorithms for inequality constrained problems J. P. EvansF. J. Gould OriginalPaper Pages: 324 - 329
A fundamental problem in linear inequalities with applications to the travelling salesman problem Katta G. Murty OriginalPaper Pages: 296 - 308
Extremization of functions with equality constraints H. KwakernaakR. C. W. Strijbos OriginalPaper Pages: 279 - 295
Updated triangular factors of the basis to maintain sparsity in the product form simplex method J. J. H. ForrestJ. A. Tomlin OriginalPaper Pages: 263 - 278
