Linear programming with spheres and hemispheres of objective vectors B. Curtis EavesAlan J. HoffmanHui Hu OriginalPaper Pages: 1 - 16
A primal projective interior point method for linear programming Donald GoldfarbDong Xiao OriginalPaper Pages: 17 - 43
An infeasible (exterior point) simplex algorithm for assignment problems Konstantinos Paparrizos OriginalPaper Pages: 45 - 54
Solving knapsack sharing problems with general tradeoff functions J. Randall Brown OriginalPaper Pages: 55 - 73
Factorized quasi-Newton methods for nonlinear least squares problems Hiroshi YabeToshihiko Takahashi OriginalPaper Pages: 75 - 100
A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems Jong-Shi Pang OriginalPaper Pages: 101 - 131
The relationship between integer and real solutions of constrained convex programming Michael WermanDavid Magagnosc Short communication Pages: 133 - 135
Solution of large-scale symmetric travelling salesman problems Martin GrötschelOlaf Holland OriginalPaper Pages: 141 - 202
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function Robert M. Freund OriginalPaper Pages: 203 - 222
A class of methods for solving large, convex quadratic programs subject to box constraints Eugene K. YangJon W. Tolle OriginalPaper Pages: 223 - 228
Normal conical algorithm for concave minimization over polytopes Hoang Tuy OriginalPaper Pages: 229 - 245
Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classesQ andQ 0 Faiz A. Al-Khayyal OriginalPaper Pages: 247 - 255
Fixed point theorems for discontinuous mapping Ludwig J. CrommeImmo Diener OriginalPaper Pages: 257 - 267
The equivalence of strict convexity and injectivity of the gradient in bounded level sets Andreas GriewankHubertus Th. JongenMan Kam Kwong OriginalPaper Pages: 273 - 278
Preliminary announcement of the Sixth International Conference on Stochastic Programming Notice Pages: 279 - 279
Sequential quadratic programming for certain parameter identification problems C. T. KelleyS. J. Wright OriginalPaper Pages: 281 - 305
Penalization in non-classical convex programming via variational convergence P. AlartB. Lemaire OriginalPaper Pages: 307 - 331
Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem Bernd Luderer OriginalPaper Pages: 333 - 348
On rates of convergence and asymptotic normality in the multiknapsack problem Sara van de GeerLeen Stougie OriginalPaper Pages: 349 - 358
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities Denis NaddefGiovanni Rinaldi OriginalPaper Pages: 359 - 400