Closure in Independence Systems

Pages:159–171

Published Online:May 1, 1982

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

Algebraic Linear Programming

Pages:172–182

Published Online:May 1, 1982

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

Locating Centers on a Tree with Discontinuous Supply and Demand Regions

Pages:183–197

Published Online:May 1, 1982

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

The Contraction Mapping Approach to the Perron-Frobenius Theory: Why Hilbert's Metric?

Pages:198–210

Published Online:May 1, 1982

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

The Generalized Quasi-Variational Inequality Problem

Pages:211–222

Published Online:May 1, 1982

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

Sojourn Times in Queueing Networks

Pages:223–244

Published Online:May 1, 1982

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

Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems

Pages:245–252

Published Online:May 1, 1982

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

On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

Pages:253–261

Published Online:May 1, 1982

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

Queue Disciplines in Heavy Traffic

Pages:262–271

Published Online:May 1, 1982

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

A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem

Pages:272–294

Published Online:May 1, 1982

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

A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets

Pages:295–313

Published Online:May 1, 1982

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

Projection in Certain Spaces of Set Functions

Pages:314–318

Published Online:May 1, 1982

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

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.