A Note on the Multi-Commodity Warehouse Problem

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.

• 저널Management Science · 5(3) · 327–331
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.5.3.327
• 저자Willard L. Eastman