Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - July 6, 2026

Available Issues

April 10, 2013 - July 6, 2026

Semi-Markov Decision Processes with Unbounded Rewards

Pages:717–731

Published Online:March 1, 1973

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

Preview Abstract
Joint Pricing and Inventory Decisions for Constant Priced Items

Pages:732–738

Published Online:March 1, 1973

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

Preview Abstract
An Example of Loosely Coupled Stages in Dynamic Programming

Pages:739–746

Published Online:March 1, 1973

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

Preview Abstract
Stochastic Programs with Recourse: Random Recourse Costs Only

Pages:747–750

Published Online:March 1, 1973

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

Preview Abstract
Linear Programming with Relative Bounded Variables

Pages:751–759

Published Online:November 24, 2015

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

Preview Abstract
Minimax Policies for Selling a Nondivisible Asset

Pages:760–762

Published Online:November 24, 2015

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

Preview Abstract
Optimal Use of Control Charts for Controlling Current Production

Pages:763–772

Published Online:March 1, 1973

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

Preview Abstract
Bounds on the Wait in a GI/M/k Queue

Pages:773–777

Published Online:March 1, 1973

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

Preview Abstract
The Joint Stationary Multivariate Queue Length Distribution in a Single Server Queueing System with N Queues, Arbitrary Priorities, and a General Probabilistic Inter-Queue Transition Matrix

Pages:778–782

Published Online:March 1, 1973

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

Preview Abstract
Duality Theory for Infinite Horizon Convex Models

Pages:783–789

Published Online:March 1, 1973

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

Preview Abstract
Computational Experience with an M-Salesman Traveling Salesman Algorithm

Pages:790–799

Published Online:March 1, 1973

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

Preview Abstract
An Analysis of a Multi-Line Re-Order System Using a Can-Order Policy

Pages:800–808

Published Online:March 1, 1973

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

Preview Abstract
The Equivalence of Integer Programs to Constrained Recursive Systems

Pages:809–824

Published Online:March 1, 1973

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

Preview Abstract
The Use of Distribution Functions to Represent Utility Functions

Pages:825–829

Published Online:March 1, 1973

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

Preview Abstract
Free Access
Communications to the Editor

Pages:830–837

Published Online:March 1, 1973

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

Preview Abstract
Free Access
Notes About Authors

Pages:838–840

Published Online:March 1, 1973

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

Previous
Back to Top
Next
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.
Agree