Research Article

Monotonicity in Generalized Semi-Markov Processes

Pages:1–21

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.1

Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better

Pages:22–35

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.22

Approximation Schemes for the Restricted Shortest Path Problem

Pages:36–42

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.36

New Partitioning Method for a Class of Nonconvex Optimization Problems

Pages:43–60

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.43

Sensitivity Analysis for Variational Inequalities

Pages:61–76

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.61

On Solution Stability of the Linear Complementarity Problem

Pages:77–83

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.77

Queueing Simulation in Heavy Traffic

Pages:84–111

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.84

On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization

Pages:112–131

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.112

Bounds on the Sensitivity of Generalised Semi-Markov Processes with a Single Generally Distributed Lifetime

Pages:132–147

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.132

On the Existence of an Arrow-Radner Equilibrium in the Case of Complete Markets. A Remark

Pages:148–163

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.148

The Nucleolus of a Matrix Game and Other Nucleoli

Pages:164–174

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.164

Correlated Equilibria in Two-Player Repeated Games with Nonobservable Actions

Pages:175–199

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.175

Two-Player Repeated Games with Nonobservable Actions and Observable Payoffs

Pages:200–224

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.200

On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming

Pages:225–253

Published Online:February 1, 1992

https://doi.org/10.1287/moor.17.1.225

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.