Additively decomposed quasiconvex functions Gerard DebreuTjalling C. Koopmans OriginalPaper Pages: 1 - 38
Random polytopes: Their definition, generation and aggregate properties Jerrold H. MayRobert L. Smith OriginalPaper Pages: 39 - 54
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases J. K. Reid OriginalPaper Pages: 55 - 69
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems A. Ben-TalJ. Zowe OriginalPaper Pages: 70 - 91
A mathematical programming approach for determining oligopolistic market equilibrium Frederic H. MurphyHanif D. SheraliAllen L. Soyster OriginalPaper Pages: 92 - 106
Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints M. E. DyerJ. Walker OriginalPaper Pages: 107 - 112
Nonlinear programming via an exact penalty function: Asymptotic analysis T. F. ColemanA. R. Conn OriginalPaper Pages: 123 - 136
Nonlinear programming via an exact penalty function: Global analysis T. F. ColemanA. R. Conn OriginalPaper Pages: 137 - 161
Polyhedral extensions of some theorems of linear programming L. McLinden OriginalPaper Pages: 162 - 176
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods Masakazu KojimaYoshitsugu Yamamoto OriginalPaper Pages: 177 - 215
On the computational complexity of piecewise-linear homotopy algorithms Michael J. Todd OriginalPaper Pages: 216 - 224
Penalty for zero–one integer equivalent problem Bahman KalantariJ. B. Rosen Short Communication Pages: 229 - 232
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions C. LemarechalR. Mifflin OriginalPaper Pages: 241 - 256
On the differential properties of the support function of the∈-subdifferential of a convex function Alfred Auslender OriginalPaper Pages: 257 - 268
Iterative methods for variational and complementarity problems J. S. PangD. Chan OriginalPaper Pages: 284 - 313
The value of the stochastic solution in stochastic linear programs with fixed recourse John R. Birge OriginalPaper Pages: 314 - 325
Global saddle-point duality for quasi-concave programs, II Jacob Flachs OriginalPaper Pages: 326 - 345
Least absolute value and chebychev estimation utilizing least squares results Michael G. SklarRonald D. Armstrong Short Communication Pages: 346 - 352
Global minimum test problem construction Yuan Y. SungJ. B. Rosen Short Communication Pages: 353 - 355
A Lipschitz constant associated with lemke's closest-point principle John M. Danskin Short Communication Pages: 356 - 358
Netflow83: International workshop on network flow optimization theory and practice Notice Pages: 359 - 359