Knowledge that Transforms

We study an average‐cost stochastic inventory control problem in which the firm can replenish inventory and adjust the price at anytime. We establish the optimality to change the price from low to high in each replenishment cycle as inventory is depleted. With costly price adjustment, scale economies of inventory replenishment are reflected in the cycle time instead of lot size—An increased fixed ordering cost leads to an extended replenishment cycle but does not necessarily increase the order quantity. A reduced marginal cost of ordering calls for an increased order quantity, as well as speeding up product selling within a cycle. We derive useful properties of the profit function that allows for reducing computational complexity of the problem. For systems requiring short replenishment cycles, the optimal solution can be easily computed by applying these properties. For systems requiring long replenishment cycles, we further consider a relaxed problem that is computational tractable. Under this relaxation, the sum of fixed ordering cost and price adjustment cost is equal to (greater than, less than) the total inventory holding cost within a replenishment cycle when the inventory holding cost is linear (convex, concave) in the stock level. Moreover, under the optimal solution, the time‐average profit is the same across all price segments when the inventory holding cost is accounted properly. Through a numerical study, we demonstrate that inventory‐based dynamic pricing can lead to significant profit improvement compared with static pricing and limited price adjustment can yield a benefit that is close to unlimited price adjustment. To be able to enjoy the benefit of dynamic pricing, however, it is important to appropriately choose inventory levels at which the price is revised.

We formalize R&D as a search process for technology improvements across different technological domains. Technology improvements from a specific domain draw upon a common knowledge base, and as such they share technological content. Moreover, different domains may rely on similar scientific principles, and therefore, knowledge about the technology improvements by one domain might be transferable to another. We analyze how such a technological relatedness shapes the direction of R&D search when knowledge generated from past search efforts disseminates to rival firms. We show that firms optimally diversify their search efforts, even toward domains that are riskier and less promising on expectation. This is amplified for higher competition intensity, i.e., higher cross‐product substitutability. Our work also suggests that different sources of learning about the domains may have opposite effects on the direction of search. Higher ability to infer the potential of an explored domain prompts the clustering of searches, whereas the ability to learn across domains prompts diversification. Finally, we discuss the technological landscape properties that prompt firms to engage in a sequential R&D search, instead of a parallel competitive search.

In procurement auctions, the object for sale is a contract, bidders are suppliers, and the bid taker is a buyer. The suppliers bidding for the contract are usually the current supplier (the incumbent) and a group of potential new suppliers (the entrants). As the buyer has an ongoing relationship with the incumbent, he needs to adjust the bids of the entrants to include non‐price attributes, such as the switching costs. The buyer can run a scoring auction, in which suppliers compete on the adjusted bids or scores , or, he can run a buyer‐determined auction, in which suppliers compete on the price , and the buyer adjusts a certain number of the bids with the non‐price attributes after the auction to determine the winner. Unless the incumbent has a significant cost advantage over the entrants, I find that the scoring auction yields a lower average cost for the buyer, if the non‐price attributes are available. If the non‐price attributes are difficult or expensive to obtain, the buyer could run a buyer‐determined auction adjusting only the lowest price bid.

In the classic revenue management (RM) problem of selling a fixed quantity of perishable inventories to price‐sensitive non‐strategic consumers over a finite horizon, the optimal pricing decision at any time depends on two important factors: consumer valuation and bid price. The former is determined exogenously by the demand side, while the latter is determined jointly by the inventory level on the supply side and the consumer valuations in the time remaining within the selling horizon. Because of the importance of bid prices in theory and practice of RM, this study aims to enhance the understanding of the intertemporal behavior of bid prices in dynamic RM environments. We provide a probabilistic characterization of the optimal policies from the perspective of bid‐price processes. We show that an optimal bid‐price process has an upward trend over time before the inventory level falls to one and then has a downward trend. This intertemporal up‐then‐down pattern of bid‐price processes is related to two fundamental static properties of the optimal bid prices: (i) At any given time, a lower inventory level yields a higher optimal bid price, which is referred to as the resource scarcity effect ; (ii) Given any inventory level, the optimal bid price decreases with time; that is referred to as the resource perishability effect . The demonstrated upward trend implies that the optimal bid‐price process is mainly driven by the resource scarcity effect, while the downward trend implies that the bid‐price process is mainly driven by the resource perishability effect. We also demonstrate how optimal bid price and consumer valuation, as two competing forces, interact over time to drive the optimal‐price process. The results are also extended to the network RM problems.

We study competitive capacity investment for the emergence of a new market. Firms may invest either in capacity leading demand or in capacity lagging demand at different costs. We show how the lead time and other operational factors including volume flexibility, existing capacity, and demand uncertainty impact equilibrium outcomes. Our results indicate that a type of bandwagon behavior is the most likely equilibrium outcome: if both firms are going to invest, then they are most likely to act in unison. Contrary to much received wisdom, we show that leader–follower behavior is very uncommon in equilibrium where firms do not have volume flexibility, and will not occur at all if lead times are sufficiently short. On the other hand, if there is volume flexibility in production, then the likelihood of this sequential investment behavior increases. Our findings underscore the importance of operational characteristics in determining the competitive dynamics of capacity investment timing.

This study develops a theoretical model and then, using Canadian joint replacement surgery data, empirically tests the relationship between government policies that promote privately funded health care and patients’ waiting time in the public health care system. Two policies are tested: one policy allows opt‐out physicians to extra‐bill private patients, and the other provides public subsidies to private patients. We find that both policies are associated with shorter public waiting time, and that the subsidy policy appears to be more effective in waiting time reduction than the extra‐billing policy. Our findings are consistent with a dominant demand‐side effect in that these policies would provide patients an option, and some incentive, to opt out of the public health system, shifting the demand from the public health system to the private care market.

A pre‐pack is a collection of items used in retail distribution. By grouping multiple units of one or more stock keeping units (SKU), distribution and handling costs can be reduced; however, ordering flexibility at the retail outlet is limited. This paper studies an inventory system at a retail level where both pre‐packs and individual items (at additional handling cost) can be ordered. For a single‐SKU, single‐period problem, we show that the optimal policy is to order into a “band” with as few individual units as possible. For the multi‐period problem with modular demand, the band policy is still optimal, and the steady‐state distribution of the target inventory position possesses a semi‐uniform structure, which greatly facilitates the computation of optimal policies and approximations under general demand. For the multi‐SKU case, the optimal policy has a generalized band structure. Our numerical results show that pre‐pack use is beneficial when facing stable and complementary demands, and substantial handling savings at the distribution center. The cost premium of using simple policies, such as strict base‐stock and batch‐ordering (pre‐packs only), can be substantial for medium parameter ranges.

Optimized profile descent (OPD) is an operating procedure being used by airlines to improve fuel and environmental efficiency during arrival operations at airports. In this study, we develop a stochastic dynamic programming framework to manage the sequencing and separation of flights during OPD operations. We find that simple calculation based measures can be used as optimal decision rules, and that the expected annual savings can be around $29 million if such implementations are adapted by major airports in the United States. Of these savings, $24 million are direct savings for airlines due to reduced fuel usage, corresponding to a potential savings of 10%–15% in fuel consumption over current practice. We also find that most of these savings will be due to the optimal spacing of OPD flights, as opposed to the optimal sequencing policies which contribute only 14% to the total savings. Hence, optimal spacing of OPD flights is much more important than optimal sequencing of these flights. We also conclude that there is not much difference between the environmental costs of fuel‐optimal and sustainably‐optimal spacing policies. Hence, an airline‐centric approach in improving OPD operations is likely to be not in conflict with objectives that might be prioritized by other stakeholders.

Demand forecast errors threaten the profitability of high–low price promotion strategies. This article shows how to match demand and supply effectively by means of two‐segment demand forecasting and supply contracts. We find that demand depends on the path of past retail prices, which leads to only a limited number of reachable demand states. However, forecast errors cannot be entirely eliminated because competitive promotions entail some degree of random (i.e., last‐minute) pricing. A hedging approach can be deployed to distribute demand risk efficiently over multiple promotional campaigns and within the supply chain. A retailer that employs a portfolio of forward, option, and spot contracts can avoid both stockouts and excess inventories while achieving the first‐best solution and Pareto improvements. We provide an improved forecasting method as well as stochastic programs to solve for optimal production and purchasing policies such that the right amount of inventory is available at the right time. By connecting a stockpiling model of demand with the supply side, we derive insights on optimal risk management strategies for both manufacturers and retailers in a market environment characterized by frequent price promotions and multiple discount levels. We employ a data set of the German retail market for a key generator of store traffic—namely, diapers.

We propose a tractable, data‐driven demand estimation procedure based on the use of maximum entropy (ME) distributions, and apply it to a stochastic capacity control problem motivated from airline revenue management. Specifically, we study the two fare class “Littlewood” problem in a setting where the firm has access to only potentially censored sales observations; this is also known as the repeated newsvendor problem. We propose a heuristic that iteratively fits an ME distribution to all observed sales data, and in each iteration selects a protection level based on the estimated distribution. When the underlying demand distribution is discrete, we show that the sequence of protection levels converges to the optimal one almost surely, and that the ME demand forecast converges to the true demand distribution for all values below the optimal protection level. That is, the proposed heuristic avoids the “spiral down” effect, making it attractive for problems of joint forecasting and revenue optimization problems in the presence of censored observations.