Finite horizon approximations of infinite horizon linear programs Richard C. Grinold OriginalPaper Pages: 1 - 17
Using shortest paths in some transshipment problems with concave costs Gery DaeninckYves Smeers OriginalPaper Pages: 18 - 25
Experiments in mixed-integer linear programming using pseudo-costs J. -M. GauthierG. Ribière OriginalPaper Pages: 26 - 47
Isotone solutions of parametric linear complementarity problems Ikuyo Kaneko OriginalPaper Pages: 48 - 59
On monotonicity in parametric linear complementarity problems Nimrod Megiddo OriginalPaper Pages: 60 - 66
The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals M. C. Bartholomew-Biggs OriginalPaper Pages: 67 - 80
An algorithm for determining all extreme points of a convex polytope M. E. DyerL. G. Proll OriginalPaper Pages: 81 - 96
On the integer-valued variables in the linear vertex packing problem Jean-Claude PicardMaurice Queyranne OriginalPaper Pages: 97 - 101
On the existence and uniqueness of solutions in nonlinear complementarity theory Nimrod MegiddoMasakazu Kojima OriginalPaper Pages: 110 - 130
A monotone complementarity problem with feasible solutions but no complementary solutions Nimrod Megiddo Short Communication Pages: 131 - 132
A note on the necessary conditions for exact aggregation of linear programming models Antonio GuccioneNoriyoshi Oguchi Short Communication Pages: 133 - 135
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming Jacques Gauvin Short Communication Pages: 136 - 138
On some properties of L1 estimators J. E. GentleV. A. SpositoW. J. Kennedy Short Communication Pages: 139 - 140
Quadratic termination properties of Davidon's new variable metric algorithm M. J. D. Powell Short Communication Pages: 141 - 147
Design and implementation of optimization software F. A. LootsmaH. J. Greenberg Notice Pages: 149 - 150
Nonlinear leastpth optimization and nonlinear programming Christakis Charalambous OriginalPaper Pages: 195 - 225
The zero pivot phenomenon in transportation and assignment problems and its computational implications B. GavishP. SchweitzerE. Shlifer OriginalPaper Pages: 226 - 240
Hierarchical partition—a new optimal pivoting algorithm T. D. LinR. S. H. Mah OriginalPaper Pages: 260 - 278
Matrix factorizations in optimization of nonlinear functions subject to linear constraints — an addendum Donald Goldfarb Short Communication Pages: 279 - 280
The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming J. D. BuysR. Gonin Short Communication Pages: 281 - 284
Testing for complete efficiency in a vector maximization problem Mathilde Benveniste Short Communication Pages: 285 - 288
Generalization of some duality theorems in nonlinear programming D. G. MahajanM. N. Vartak OriginalPaper Pages: 293 - 317
An algebraic approach to assignment problems Rainer E. BurkardWilli HahnUwe Zimmermann OriginalPaper Pages: 318 - 327
Constructive proofs of theorems relating to:F(x) = y, with applications A. CharnesC. B. GarciaC. E. Lemke OriginalPaper Pages: 328 - 343
An assessment of two approaches to variable metric methods Kenneth W. Brodlie OriginalPaper Pages: 344 - 355
Examples of non-convergence of conjugate descent algorithms with exact line-searches J. R. Thompson OriginalPaper Pages: 356 - 360
Cost operator algorithms for the transportation problem V. SrinivasanG. L. Thompson OriginalPaper Pages: 372 - 391
The complementary unboundedness of dual feasible solution sets in convex programming Elmor L. Peterson OriginalPaper Pages: 392 - 405
Efficiency in multiple objective optimization problems R. E. WendellD. N. Lee OriginalPaper Pages: 406 - 414