1. Introduction

   • Neculai Andrei

   EditorialNotes Pages: 287 - 288

2. Stable barrier-projection and barrier-Newton methods in linear programming

   • Yuri G. Evtushenko
   • Vitali G. Zhadan

   OriginalPaper Pages: 289 - 303

3. Scaling, shifting and weighting in interior-point methods

   • Michael J. Todd

   OriginalPaper Pages: 305 - 315

4. Supernode processing of mixed-integer models

   • Uwe H. Suhl
   • Ralf Szymanski

   OriginalPaper Pages: 317 - 331

5. Random problem generation and the computation of efficient extreme points in multiple objective linear programming

   • Ralph E. Steuer

   OriginalPaper Pages: 333 - 347

6. On the efficacy of distributed simplex algorithms for linear programming

   • James K. Ho
   • R. P. Sundarraj

   OriginalPaper Pages: 349 - 363