Capital Budgeting of Interrelated Projects: Survey and Synthesis

Pages:485–516

Published Online:March 1, 1966

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

A Min-Max Inventory Model

Pages:517–529

Published Online:March 1, 1966

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

A Linear Approach to the Dynamic Inventory Problem

Pages:530–540

Published Online:March 1, 1966

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

Scheduling Short-Run Changes in Production to Minimize Long-Run Expected Costs

Pages:541–554

Published Online:March 1, 1966

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

The Dual Method for the Generalized Transportation Problem

Pages:555–568

Published Online:March 1, 1966

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

An Extension of the Gomory Mixed-Integer Algorithm to Mixed-Discrete Variables

Pages:569–575

Published Online:March 1, 1966

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

An Algorithm for the Solution of Mixed Integer Programming Problems

Pages:576–587

Published Online:March 1, 1966

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

Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems

Pages:588–608

Published Online:March 1, 1966

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

On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming

Pages:609–615

Published Online:March 1, 1966

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

Free Access
Communications to the Editor—The Use of Regression Equations to Predict Manpower Requirements: Critical Comments

Pages:616–618

Published Online:March 1, 1966

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

A Comment on Baumol (E, L) Efficient Portfolios

Pages:619–621

Published Online:March 1, 1966

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

Optimal Programming of Lot Sizes, Inventories and Labor Allocations—A Comment

Pages:622–625

Published Online:March 1, 1966

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

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.