A Note on the Multi-Commodity Warehouse Problem

Willard L. Eastman
Additional contact information
Willard L. Eastman: The Computation Laboratory of Harvard University

Management Science, 1959, vol. 5, issue 3, 327-331

Abstract: The warehouse problem requires the determination of a sequence of buy and sell decisions at discrete points in time. By equating points in time and points in space, the warehouse problem can be identified with a special case of the shortest-route problem. In the present note a special matrix formulation is employed to yield simple solutions to both problems. An example is included to illustrate the method.

Date: 1959
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.5.3.327 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:5:y:1959:i:3:p:327-331

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().