Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function András PrékopaWenzhong Li OriginalPaper Pages: 1 - 16
A polyhedron with alls—t cuts as vertices, and adjacency of cuts Naveen GargVijay V. Vazirani OriginalPaper Pages: 17 - 25
On bilevel programming, Part I: General nonlinear cases James E. FalkJiming Liu OriginalPaper Pages: 47 - 72
On structure and stability in stochastic programs with random technology matrix and complete integer recourse Rüdiger Schultz OriginalPaper Pages: 73 - 89
The curvature integral and the complexity of linear complementarity problems Gongyun ZhaoJishan Zhu OriginalPaper Pages: 107 - 122
Pseudopower expansion of solutions of generalized equations and constrained optimization problems Joseph Frédéric BonnansAgnès Sulem OriginalPaper Pages: 123 - 148
Directional differentiability of the optimal value function in convex semi-infinite programming Alexander Shapiro OriginalPaper Pages: 149 - 157
Directional derivatives of the solution of a parametric nonlinear program D. RalphS. Dempe OriginalPaper Pages: 159 - 172
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems J. A. HoogeveenS. L. van de Velde OriginalPaper Pages: 173 - 190
On the equivalence of nonlinear complementarity problems and least-element problems Siegfried SchaibleJen-Chih Yao OriginalPaper Pages: 191 - 200
The fleet assignment problem: Solving a large-scale integer program Christopher A. HaneCynthia BarnhartGabriele Sigismondi OriginalPaper Pages: 211 - 232
Unification of basic and composite nondifferentiable optimization Jean Pierre DussaultYoussou Gningue OriginalPaper Pages: 233 - 249
Primal—dual methods for linear programming Philip E. GillWalter MurrayMichael A. Saunders OriginalPaper Pages: 251 - 277
Linear programming, complexity theory and elementary functional analysis James Renegar OriginalPaper Pages: 279 - 351
