Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system Robert M. FreundJorge R. Vera Pages: 225 - 260
Basis- and partition identification for quadratic programming and linear complementarity problems Arjan B. BerkelaarBenjamin JansenTamás Terlaky Pages: 261 - 282
Ergodic, primal convergence in dual subgradient schemes for convex programming Torbjörn LarssonMichael PatrikssonAnn-Brith Strömberg Pages: 283 - 312
An infeasible-interior-point potential-reduction algorithm for linear programming Reha H. Tütüncü Pages: 313 - 334
bc–opt: a branch-and-cut code for mixed integer programs Cécile CordierHugues MarchandLaurence A. Wolsey Pages: 335 - 353
On some balanced, totally balanced and submodular delivery games Daniel GranotHerbert HamersStef Tijs Pages: 355 - 366
A hybrid Newton method for solving the variational inequality problem via the D-gap function Ji-Ming PengMasao Fukushima Pages: 367 - 386
On existence and uniqueness of stationary points in semi-infinite optimization Jan-J. Rückmann Pages: 387 - 415
Decision-making by hierarchies of discordant agents Xiaotie DengChristos Papadimitriou Pages: 417 - 431
Coercivity conditions and variational inequalities Aris DaniilidisNicolas Hadjisavvas Pages: 433 - 438
Errata in implicit multifunction theorems for the sensitivity analysis of variational conditions A.B. Levy Short Communication Pages: 439 - 441
