Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra Andrzej Ruszczyński Pages: 195 - 215
On some interior-point algorithms for nonconvex quadratic optimization Paul TsengYinyu Ye Pages: 217 - 225
Combinatorial interior point methods for generalized network flow problems Donald GoldfarbYiqing Lin Pages: 227 - 246
Convex extensions and envelopes of lower semi-continuous functions Mohit TawarmalaniNikolaos V Sahinidis Pages: 247 - 263
A note on sensitivity of value functions of mathematical programs with complementarity constraints Xinmin HuDaniel Ralph Pages: 265 - 279
Generalized Goal Programming: polynomial methods and applications Emilio CarrizosaJörg Fliege Pages: 281 - 303
An analytic center quadratic cut method for the convex quadratic feasibility problem Faranak Sharifi MokhtarianJean-Louis Goffin Pages: 305 - 325
On the convergence of the Weiszfeld algorithm Lázaro CánovasRoberto CañavateAlfredo Marín Pages: 327 - 330