Journal article
A Greedy Network Flow Algorithm for A Warehouse Leasing Problem
AIIE transactions, Vol.11(3), pp.170-182
09/01/1979
DOI: 10.1080/05695557908974459
Abstract
In this paper we consider the problem of a firm which must lease warehouse space over a finite planning horizon. Demand for space in each time period is a random variable with known density function. The firm contracts for warehouse space for each time period at the beginning of the planning horizon via a primary contract. If demand exceeds space in any period, additional space can be obtained via a secondary contract. The leasing problem is shown to be equivalent to a linear programming problem under reasonable assumptions. The dual to the linear program is shown to be equivalent to a network flow problem which can be solved via a greedy algorithm, and admits a rather simple primal variable recovery procedure. Computational evidence indicates that dual problems with some 200,000 arcs can be solved efficiently.
Details
- Title: Subtitle
- A Greedy Network Flow Algorithm for A Warehouse Leasing Problem
- Creators
- Timothy J. Lowe - Purdue University West LafayetteRichard L. Francis - University of FloridaEric W. Reinhardt - University of North Florida
- Resource Type
- Journal article
- Publication Details
- AIIE transactions, Vol.11(3), pp.170-182
- DOI
- 10.1080/05695557908974459
- ISSN
- 0569-5554
- Publisher
- Taylor & Francis Group
- Number of pages
- 13
- Language
- English
- Date published
- 09/01/1979
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963105602771
Metrics
1 Record Views