Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

On the Convergence in Distribution of Measurable Multifunctions (Random Sets) Normal Integrands, Stochastic Processes and Stochastic Infima

Pages:385–419

Published Online:August 1, 1986

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

Preview Abstract
On the Convergence in Probability of Random Sets (Measurable Multifunctions)

Pages:420–422

Published Online:August 1, 1986

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

Preview Abstract
Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model

Pages:423–432

Published Online:August 1, 1986

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

Preview Abstract
Generalized S-Shapedness of Reliability Functions

Pages:433–441

Published Online:August 1, 1986

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

Preview Abstract
Upper Bounds for Single Server Queues with Doubly Stochastic Poisson Arrivals

Pages:442–450

Published Online:August 1, 1986

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

Preview Abstract
An Upper Bound Theorem for Polytope Pairs

Pages:451–464

Published Online:August 1, 1986

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

Preview Abstract
The Queue M|G|1 with Markov Modulated Arrivals and Services

Pages:465–483

Published Online:August 1, 1986

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

Preview Abstract
Network Reliability and Inner-Four-Cycle-Free Graphs

Pages:484–505

Published Online:August 1, 1986

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

Preview Abstract
On the Existence of Easy Initial States for Undiscounted Stochastic Games

Pages:506–513

Published Online:August 1, 1986

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

Preview Abstract
The Uniqueness of Stationary Distributions for the GI/G/S Queue

Pages:514–520

Published Online:August 1, 1986

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

Preview Abstract
Pointwise and Uniformly Good Stationary Strategies for Dynamic Programming Models

Pages:521–535

Published Online:August 1, 1986

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree