A fundamental decision every merchant has to make is on is how large his stores should be. This is particularly true in light of the drastic changes retail concepts have seen in the last decade. There has been a noticeable tendency, particularly for food and convenience retailers, to open more...

The network choice revenue management problem models customers as choosing from an offerset, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear...

In many implemented network revenue management systems, a bid price control is being used. In this form of control, bid prices are attached to resources, and a product is offered if the revenue derived from it exceeds the sum of the bid prices of its consumed resources. This approach is...

Companies today generally hold several thousands SKUs (stock-keeping units) in stock. With an ever increasing trend towards highly customized products, the number of SKUs held by companies is likely to increase even more in the future. For each of the SKUs held in stock, a decision has to be...

In recent years, many traditional practitioners of revenue management such as airlines or hotels were confronted with aggressive low-cost competition. In order to stay competitive, these firms responded by reducing fare restrictions that were originally meant to fence off customer segments. In...

We consider the problem of a firm selling multiple products that consume a single resource over a finite time period. The amount of the resource is exogenously fixed. We analyze the difference between a dynamic pricing policy and a list price capacity control policy. The dynamic pricing policy...

Consider a firm that owns a fixed capacity of a resource that is consumed in the production or delivery of multiple products. The firm's problem is to maximize its total expected revenues over a finite horizon either by choosing a dynamic pricing strategy for each product, or, if prices are...

We develop a competitive pricing model which combines the complexity of time-varying demand and cost functions and that of scale economies arising from dynamic lot sizing costs. Each firm can replenish inventory in each of the T periods into which the planing horizon is partitioned. Fixed as...

We consider a family of N items which are produced in or obtained from the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is...

This paper conducts a probabilistic analysis of an important class of heuristics for multiitem capacitated lot sizing problems. We characterize the asymptotic performance of so-called progressive interval heuristics as T, the length of the planning horizon, goes to infinity, assuming the data...