Operations Research Center Working Papers: Recent submissions

Now showing items 256-258 of 372

    • On Massively Parallel Algorithm for Nonlinear Stochastic Network Problems 

      Nielson, Soren S.; Zenios, Stavros A. (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
      We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. The algorithm is based on the framework of row-action methods. The problem is formulated by replicating the first-stage ...

    • Shortest Paths, Network Design and Associated Polyhedra 

      Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1990-04)
      We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network ...

    • Theoretical Efficiency of A Shifted Barrier Function Algorithm for Linear Programming 

      Freund, Robert M. (Massachusetts Institute of Technology, Operations Research Center, 1989-04)
      This paper examines the theoretical efficiency of solving a standard-form linear program by solving a sequence of shifted-barrier problems of the form minimize cTx - n (xj + ehj) j.,1 x s.t. Ax = b , x + e h > , for a given ...