Converting Linear Programs to Network Problems

Pages:321–357

Published Online:August 1, 1980

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

On the Number of Component Failures in Systems Whose Component Lives are Exchangeable

Pages:358–365

Published Online:August 1, 1980

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

Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations

Pages:366–372

Published Online:August 1, 1980

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

The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities

Pages:373–380

Published Online:August 1, 1980

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

A General Failure Model: Optimal Replacement with State Dependent Replacement and Failure Costs

Pages:381–387

Published Online:August 1, 1980

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

The Relaxation Method for Solving Systems of Linear Inequalities

Pages:388–414

Published Online:August 1, 1980

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

An Analysis of Preemptive Multiprocessor Job Scheduling

Pages:415–421

Published Online:August 1, 1980

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

Circular Cuts in a Network

Pages:422–434

Published Online:August 1, 1980

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

Locating an Isolated Global Minimizer of a Constrained Nonconvex Program

Pages:435–443

Published Online:August 1, 1980

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

Accretive Operators and Markov Decision Processes

Pages:444–459

Published Online:August 1, 1980

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

Jackson’s Conjecture on Earliest Due Date Scheduling

Pages:460–466

Published Online:August 1, 1980

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

Optimal Parameter Selection of Parabolic Systems

Pages:467–479

Published Online:August 1, 1980

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

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.