| Article ID: | iaor20033059 |
| Country: | United States |
| Volume: | 78 |
| Issue: | 4 |
| Start Page Number: | 481 |
| End Page Number: | 488 |
| Publication Date: | Jan 2001 |
| Journal: | International Journal of Computer Mathematics |
| Authors: | Omosigho S.E. |
| Keywords: | programming: dynamic |
The inventory replenishment problem with a linear demand pattern when no shortage is permitted and the time horizon is finite is examined. An explicit inverse method for determining the replenishment time