Research Article

Polling Systems in Heavy Traffic: A Bessel Process Limit

Pages:257–304

Published Online:May 1, 1998

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

On the Estimation of the Throughput for a Class of Stochastic Resources Sharing Systems

Pages:305–321

Published Online:May 1, 1998

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

Perfect and Ideal 0, ±1 Matrices

Pages:322–338

Published Online:May 1, 1998

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

On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues

Pages:339–358

Published Online:May 1, 1998

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

Persistency in 0-1 Polynomial Programming

Pages:359–389

Published Online:May 1, 1998

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

Integer Solution for Linear Complementarity Problem

Pages:390–402

Published Online:May 1, 1998

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

A Simplicial Approach to the Determination of an Integer Point of a Simplex

Pages:403–415

Published Online:May 1, 1998

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

Existence and Discovery of Average Optimal Solutions in Deterministic Infinite Horizon Optimization

Pages:416–432

Published Online:May 1, 1998

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

Approximating Extreme Points of Infinite Dimensional Convex Sets

Pages:433–442

Published Online:May 1, 1998

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

Global Error Bounds for Convex Multifunctions and Applications

Pages:443–462

Published Online:May 1, 1998

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

A Homological Characterization of Q-Matrices

Pages:463–478

Published Online:May 1, 1998

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

On the Convergence of Fictitious Play

Pages:479–511

Published Online:May 1, 1998

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

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.