Dynamic learning,pricing, and ordering by a censored newsvendor

We address the problem of determining optimal ordering and pricing policies in a finite‐horizon newsvendor model with unobservable lost sales. The demand distribution is price‐dependent and involves unknown parameters. We consider both the cases of perishable and nonperishable inventory. A very general class of demand functions is studied in this paper. We derive the optimal ordering and pricing policies as unique functions of the stocking factor (which is a linear transformation of the safety factor). An important expression is obtained for the marginal expected value of information. As a consequence, we show when lost sales are unobservable, with perishable inventory the optimal stocking factor is always at least as large as the one given by the single‐period model; however, if inventory is nonperishable, this result holds only under a strong condition. This expression also helps to explain why the optimal stocking factor of a period may not increase with the length of the problem. We compare this behavior with that of a full information model. We further examine the implications of the results to the special cases when demand uncertainty is described by additive and multiplicative models. For the additive case, we show that if demand is censored, the optimal policy is to order more as well as charge higher retail prices when compared to the policies in the single‐period model and the full information model. We also compare the optimal and myopic policies for the additive and multiplicative models. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Assortment optimization with position effects under the nested logit model

We study the assortment optimization problem with position effects under the nested logit model, whose goal is to find the revenue-maximizing subset of products as well as their corresponding display positions. In this joint assortment-position optimization problem, the choices of products are affected by not only their qualities and prices but also the positions where they are displayed. Despite determining the assortment and their corresponding display positions sequentially, we propose to solve this problem in an integrated way to obtain the optimal solution. We formulate this problem as a nonlinear binary integer programming model and develop a dynamic programming based solution approach to obtain the optimal assortment-position assignments. We carry out extensive numerical experiments to evaluate the benefit of our integrated approach. The most important insight we discover is that it is not necessarily better to put the most attractive products in the best position. Moreover, we show that compared to the sequential approaches, our approach can improve revenue by 10.38% on average, which suggests that firms should take into consideration position effects when making assortment decisions. Finally, we discuss results related to two extensions of this problem, that is, the special case when positions are preassigned to nests, and the joint assortment-position-price optimization problem.     

Inventory control and periodic price discounting campaigns

This paper develops an inventory model that determines replenishment strategies for buyers facing situations in which sellers offer price‐discounting campaigns at random times as a way to drive sales or clear excess inventory. Specifically, the model deals with the inventory of a single item that is maintained to meet a constant demand over time. The item can be purchased at two different prices denoted high and low. We assume that the low price goes into effect at random points in time following an exponential distribution and lasts for a random length of time following another exponential distribution. We highlight a replenishment strategy that will lead to the lowest inventory holding and ordering costs possible. This strategy is to replenish inventory only when current levels are below a certain threshold when the low price is offered and the replenishment is to a higher order‐up‐to level than the one currently in use when inventory depletes to zero and the price is high. Our analysis provides new insight into the behavior of the optimal replenishment strategy in response to changes in the ratio of purchase prices together with changes in the ratio of the duration of a low‐price period to that of a high‐price period. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

A nonlinear continuous time optimal control model of dynamic pricing and inventory control with no backorders

In this paper, we present a continuous time optimal control model for studying a dynamic pricing and inventory control problem for a make‐to‐stock manufacturing system. We consider a multiproduct capacitated, dynamic setting. We introduce a demand‐based model where the demand is a linear function of the price, the inventory cost is linear, the production cost is an increasing strictly convex function of the production rate, and all coefficients are time‐dependent. A key part of the model is that no backorders are allowed. We introduce and study an algorithm that computes the optimal production and pricing policy as a function of the time on a finite time horizon, and discuss some insights. Our results illustrate the role of capacity and the effects of the dynamic nature of demand in the model. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Simultaneous price,location, and capacity decisions on a line of time‐sensitive customers

Consider a monopolist who sells a single product to time‐sensitive customers located on a line segment. Customers send their orders to the nearest distribution facility, where the firm processes (customizes) these orders on a first‐come, first‐served basis before delivering them. We examine how the monopolist would locate its facilities, set their capacities, and price the product offered to maximize profits. We explicitly model customers' waiting costs due to both shipping lead times and queueing congestion delays and allow each customer to self‐select whether she orders or not, based on her reservation price. We first analyze the single‐facility problem and derive a number of interesting insights regarding the optimal solution. We show, for instance, that the optimal capacity relates to the square root of the customer volume and that the optimal price relates additively to the capacity and transportation delay costs. We also compare our solutions to a similar problem without congestion effects. We then utilize our single‐facility results to treat the multi‐facility problem. We characterize the optimal policy for serving a fixed interval of customers from multiple facilities when customers are uniformly distributed on a line. We also show how as the length of the customer interval increases, the optimal policy relates to the single‐facility problem of maximizing expected profit per unit distance. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

An adaptive forecasting algorithm and inventory policy for products with short life cycles

Products with short life cycles are becoming increasingly common in many industries, such as the personal computer (PC) and mobile phone industries. Traditional forecasting methods and inventory policies can be inappropriate for forecasting demand and managing inventory for a product with a short life cycle because they usually do not take into account the characteristics of the product life cycle. This can result in inaccurate forecasts, high inventory cost, and low service levels. Besides, many forecasting methods require a significant demand history, which is available only after the product has been sold for some time. In this paper, we present an adaptive forecasting algorithm with two characteristics. First, it uses structural knowledge on the product life cycle to model the demand. Second, it combines knowledge on the demand that is available prior to the launch of the product with actual demand data that become available after the introduction of the product to generate and update demand forecasts. Based on the forecasting algorithm, we develop an optimal inventory policy. Since the optimal inventory policy is computationally expensive, we propose three heuristics and show in a numerical study that one of the heuristics generates near‐optimal solutions. The evaluation of our approach is based on demand data from a leading PC manufacturer in the United States, where the forecasting algorithm has been implemented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Coordination of pricing and inventory control across products

We consider the joint pricing and inventory‐control problem for a retailer who orders, stocks, and sells two products. Cross‐price effects exist between the two products, which means that the demand of each product depends on the prices of both products. We derive the optimal pricing and inventory‐control policy and show that this policy differs from the base‐stock list‐price policy, which is optimal for the one‐product problem. We find that the retailer can significantly improve profits by managing the two products jointly as opposed to independently, especially when the cross‐price demand elasticity is high. We also find that the retailer can considerably improve profits by using dynamic pricing as opposed to static pricing, especially when the demand is nonstationary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Optimal retail assortments for substitutable items purchased in sets

We consider the problem of optimizing assortments in a multi‐item retail inventory system. In addition to the usual holding and stockout costs, there is a fixed cost for including any item in the assortment. Customers' preferences for items include both probabilistic substitution patterns and the desire to purchase sets of complementary items. We develop a demand model to capture this behavior, and derive tractable approximations that allow us to formulate the optimization problem as a 0–1 mixed integer linear program. Numerical examples are solved to illustrate key insights into how both complementary and substitute items affect the optimal assortment and the expected profit. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 793–822, 2003.     

Dynamic pricing in a trade-in program with replacement and new customers

Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products.     

A probabilistic analysis of a fixed partition policy for the inventory‐routing problem

We consider the Inventory‐Routing Problem (IRP) where n geographically dispersed retailers must be supplied by a central facility. The retailers experience demand for the product at a deterministic rate, and incur holding costs for keeping inventory. Distribution is performed by a fleet of capacitated vehicles. The objective is to minimize the average transportation and inventory costs per unit time over the infinite horizon. We focus on the set of Fixed Partition Policies (FPP). In an FPP, the retailers are partitioned into disjoint and collectively exhaustive sets. Each set of retailers is served independently of the others and at its optimal replenishment rate. Previous research has measured the effectiveness of an FPP solution relative to a lower bound over all policies. We propose an additional measure that is relative to the optimal FPP. In this paper we construct a polynomial‐time partitioning scheme that is shown to yield an FPP whose cost is asymptotically within 1.5% + ? of the cost of an optimal FPP, for arbitrary ? > 0. In addition, in some cases, our polynomial‐time scheme yields an FPP whose cost is asymptotically within 1.5% + ? of the minimal policy's cost (over all feasible policies). © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Untruthful probabilistic demand forecasts in vendor‐managed revenue‐sharing contracts: Coordinating the chain

Vendor‐managed revenue‐sharing arrangements are common in the newspaper and other industries. Under such arrangements, the supplier decides on the level of inventory while the retailer effectively operates under consignment, sharing the sales revenue with his supplier. We consider the case where the supplier is unable to predict demand, and must base her decisions on the retailer‐supplied probabilistic forecast for demand. We show that the retailer's best choice of a distribution to report to his supplier will not be the true demand distribution, but instead will be a degenerate distribution that surprisingly induces the supplier to provide the system‐optimal inventory quantity. (To maintain credibility, the retailer's reports of daily sales must then be consistent with his supplied forecast.) This result is robust under nonlinear production costs and nonlinear revenue‐sharing. However, if the retailer does not know the supplier's production cost, the forecast “improves” and could even be truthful. That, however, causes the supplier's order quantity to be suboptimal for the overall system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Pricing and inventory management during new product introduction when shortage creates hype

In this study, we analyze the joint pricing and inventory management during new product introduction when product shortage creates additional demand due to hype. We develop a two‐period model in which a firm launches its product at the beginning of the first period, before it observes sales in the two periods. The product is successful with an exogenous probability, or unsuccessful with the complementary probability. The hype in the second period is observed only when the product is successful. The firm learns the actual status of the product only after observing the first‐period demand. The firm must decide the stocking level and price of the product jointly at the beginning of each of the two periods. In this article, we derive some structural properties of the optimal prices and inventory levels, and show that (i) firms do not always exploit hype, (ii) firms do not always increase the price of a successful product in the second period, (iii) firms may price out an unsuccessful product in the first period if the success probability is above a threshold, and (iv) such a threshold probability is decreasing in the first‐period market potential of the successful product. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 304–320, 2015     

Competition under time‐varying demands and dynamic lot sizing costs

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 planning horizon is partitioned. Fixed as well as variable procurement costs are incurred for each procurement order, along with inventory carrying costs. Each firm adopts, at the beginning of the planning horizon, a (single) price to be employed throughout the horizon. On the basis of each period's system of demand equations, these prices determine a time series of demands for each firm, which needs to service them with an optimal corresponding dynamic lot sizing plan. We establish the existence of a price equilibrium and associated optimal dynamic lotsizing plans, under mild conditions. We also design efficient procedures to compute the equilibrium prices and dynamic lotsizing plans.© 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Integrating decisions with advance supply information in an assemble-to-order system

We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model.     

Transactional and in-store display data of a large supermarket for data-driven decision-making

This article describes daily and monthly transactional and in-store display data of a large supermarket from January to October in 2019 associated with 28 757 stock-keeping units (SKUs) in 5 categories and 41 subcategories. The database contains five parts, including information about each SKU, in-store display, daily sales, inventory, and replenishment. We also propose some research questions related to assortment planning, pricing, inventory management, and customer behavior. Researchers are welcome to develop data-driven models or other innovative methods to address these questions or other practical problems using this database.     

Locational tying of complementary retail items

We study a selling practice that we refer to as locational tying (LT), which seems to be gaining wide popularity among retailers. Under this strategy, a retailer “locationally ties” two complementary items that we denote by “primary” and “secondary.” The retailer sells the primary item in an appropriate “department” of his or her store. To stimulate demand, the secondary item is offered in the primary item's department, where it is displayed in very close proximity to the primary item. We consider two variations of LT: In the multilocation tying strategy (LT‐M), the secondary item is offered in its appropriate department in addition to the primary item's department, whereas in the single‐location tying strategy (LT‐S), it is offered only in the primary item's location. We compare these LT strategies to the traditional independent components (IC) strategy, in which the two items are sold independently (each in its own department), but the pricing/inventory decisions can be centralized (IC‐C) or decentralized (IC‐D). Assuming ample inventory, we compare and provide a ranking of the optimal prices of the four strategies. The main insight from this comparison is that relative to IC‐D, LT decreases the price of the primary item and adjusts the price of the secondary item up or down depending on its popularity in the primary item's department. We also perform a comparative statics analysis on the effect of demand and cost parameters on the optimal prices of various strategies, and identify the conditions that favor one strategy over others in terms of profitability. Then we study inventory decisions in LT under exogenous pricing by developing a model that accounts for the effect of the primary item's stock‐outs on the secondary item's demand. We find that, relative to IC‐D, LT increases the inventory level of the primary item. We also link the profitability of different strategies to the trade‐off between the increase in demand volume of the secondary item as a result of LT and the potential increase in inventory costs due to decentralizing the inventory of the secondary item. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

A two product dynamic economic lot size production model with either-or production constraints

This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Synchronizing pricing and replenishment to serve forward-looking customers

We incorporate strategic customer waiting behavior in the classical economic order quantity (EOQ) setting. The seller determines not only the timing and quantities of the inventory replenishment, but also the selling prices over time. While similar ideas of market segmentation and intertemporal price discrimination can be carried over from the travel industries to other industries, inventory replenishment considerations common to retail outlets and supermarkets introduce additional features to the optimal pricing scheme. Specifically, our study provides concrete managerial recommendations that are against the conventional wisdom on “everyday low price” (EDLP) versus “high-low pricing” (Hi-Lo). We show that in the presence of inventory costs and strategic customers, Hi-Lo instead of EDLP is optimal when customers have homogeneous valuations. This result suggests that because of strategic customer behavior, the seller obtains a new source of flexibility—the ability to induce customers to wait—which always leads to a strictly positive increase of the seller's profit. Moreover, the optimal inventory policy may feature a dry period with zero inventory, but this period does not necessarily result in a loss of sales as customers strategically wait for the upcoming promotion. Furthermore, we derive the solution approach for the optimal policy under heterogeneous customer valuation setting. Under the optimal policy, the replenishments and price promotions are synchronized, and the seller adopts high selling prices when the inventory level is low and plans a discontinuous price discount at the replenishment point when inventory is the highest.