The Status of Mathematical Inventory Theory

Pages:745–777

Published Online:July 1, 1966

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

A Dynamic Programming Approach to a Lot Size Scheduling Problem

Pages:778–784

Published Online:July 1, 1966

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

A Bayesian Analysis of the Style Goods Inventory Problem

Pages:785–797

Published Online:July 1, 1966

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

Programming with a Quadratic Constraint

Pages:798–815

Published Online:July 1, 1966

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

Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation

Pages:816–828

Published Online:July 1, 1966

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

Discrete Optimizing Solution Procedures for Linear and Nonlinear Integer Programming Problems

Pages:829–850

Published Online:July 1, 1966

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

Financial Measurement of Capital Investments

Pages:851–864

Published Online:July 1, 1966

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

Demon: Decision Mapping Via Optimum Go-No Networks—A Model for Marketing New Products

Pages:865–887

Published Online:July 1, 1966

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

The Priority Problem and Computer Time Sharing

Pages:888–906

Published Online:July 1, 1966

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

Free Access
Communications to the Editor—Generalization of a Queueing Theorem of Palm to Finite Populations

Pages:907–908

Published Online:July 1, 1966

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

Free Access
Correction to “(s − 1, s) Inventory Policy Under Compound Poisson Demand”

Pages:908–908

Published Online:July 1, 1966

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

Free Access
Erratum

Pages:908–908

Published Online:July 1, 1966

https://doi.org/10.1287/mnsc.12.11.908a

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.