A Constant-Work Model for Student Attendance and Enrollment

Pages:193–206

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.193

Intransitive Indifference in Preference Theory: A Survey

Pages:207–228

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.207

Generalized Penalty-Function Concepts in Mathematical Optimization

Pages:229–252

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.229

Searching for the Multiplier in One-Constraint Optimization Problems

Pages:253–262

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.253

Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

Pages:263–278

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.263

Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem

Pages:279–289

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.279

A Note on Quadratic Programming in Activation Analysis

Pages:290–299

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.290

Linear Programming Solutions to Ratio Games

Pages:300–305

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.300

An Enumeration Algorithm for Knapsack Problems

Pages:306–311

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.306

On Some Mixing Sequences in Queuing Theory

Pages:312–315

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.312

A Multiserver System with Preemptive Priorities

Pages:316–323

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.316

Two Problems in Markov Chains: A Topological Approach

Pages:324–333

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.324

A Review of the Literature on the Missile-Allocation Problem

Pages:334–373

Published Online:April 1, 1970

https://doi.org/10.1287/opre.18.2.334

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.