Towards a System of Systems Concepts

Pages:661–671

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.661

A Study of Lexicographic Expected Utility

Pages:672–678

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.672

Optimal Management of a Research and Development Project

Pages:679–697

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.679

On Quadratic Programming

Pages:698–711

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.698

Finding the K Shortest Loopless Paths in a Network

Pages:712–716

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.712

A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent

Pages:717–723

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.717

Production Smoothing with Stochastic Demand II: Infinite Horizon Case

Pages:724–735

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.724

Constructing Sets of Uniformly Tighter Linear Approximations for a Chance Constraint

Pages:736–749

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.736

Equipment Replacement Under Uncertainty

Pages:750–758

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.750

An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints

Pages:759–773

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.759

Free Access
Note—An Addendum to “A Model of Rational Competitive Bidding”

Pages:774–777

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.774

A Note on the Bergstrom-Smith Multi-Item Production Planning Model

Pages:783–785

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.783

Free Access
Optimal Sale of a Commodity Stockpile (Errata)

Pages:786–786

Published Online:July 1, 1971

https://doi.org/10.1287/mnsc.17.11.786

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.