The mathematics of nonlinear programming
The mathematics of nonlinear programming
Hi-index | 0.00 |
This paper shows how to allocate a limited supply of inventory in a centralized distribution system with multiple retailers subject to minimal supply commitments and maximum delivery limits for each retailer. The objective is to maximize the number of units sold by all retailers in one time period. The analysis is done by building on a classical result of Derman. The demand at each retailer is described by a probability density function and unsold portions of the supply lose their value at the end of the period.