Assortment Planning for Vertically Differentiated Products

We consider the problem of a retailer managing a category of vertically differentiated products. The retailer has to pay a fixed cost for each product included in the assortment and a variable cost per product sold. Quality levels, fixed, and variable costs are exogenously determined. Customers differ in their valuation of quality and choose the product (if any) that maximizes their utility. First, we consider a setting in which the selling prices are also fixed. We find that the optimal set of products to offer depends on the distribution of customer valuations and might include dominated products, that is, products which are less attractive than at least one other product, on every possible dimension. We develop an efficient algorithm to identify an optimal assortment. Second, we consider a setting in which the retailer also determines the selling prices. We show that in this case the optimal assortment does not include any dominated product and does not vary with the distribution of customer valuations when there is no fixed cost. We develop several efficient algorithms to identify an optimal assortment and optimally price the products. We also test the applicability of our methods with realistic data for two product categories.     

Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits

We consider assortment problems under a mixture of multinomial logit models. There is a fixed revenue associated with each product. There are multiple customer types. Customers of different types choose according to different multinomial logit models whose parameters depend on the type of the customer. The goal is to find a set of products to offer so as to maximize the expected revenue obtained over all customer types. This assortment problem under the multinomial logit model with multiple customer types is NP‐complete. Although there are heuristics to find good assortments, it is difficult to verify the optimality gap of the heuristics. In this study, motivated by the difficulty of finding optimal solutions and verifying the optimality gap of heuristics, we develop an approach to construct an upper bound on the optimal expected revenue. Our approach can quickly provide upper bounds and these upper bounds can be quite tight. In our computational experiments, over a large set of randomly generated problem instances, the upper bounds provided by our approach deviate from the optimal expected revenues by 0.15% on average and by less than one percent in the worst case. By using our upper bounds, we are able to verify the optimality gaps of a greedy heuristic accurately, even when optimal solutions are not available.     

Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters

We consider assortment optimization problems under the multinomial logit model, where the parameters of the choice model are random. The randomness in the choice model parameters is motivated by the fact that there are multiple customer segments, each with different preferences for the products, and the segment of each customer is unknown to the firm when the customer makes a purchase. This choice model is also called the mixture‐of‐logits model. The goal of the firm is to choose an assortment of products to offer that maximizes the expected revenue per customer, across all customer segments. We establish that the problem is NP complete even when there are just two customer segments. Motivated by this complexity result, we focus on assortments consisting of products with the highest revenues, which we refer to as revenue‐ordered assortments. We identify specially structured cases of the problem where revenue‐ordered assortments are optimal. When the randomness in the choice model parameters does not follow a special structure, we derive tight approximation guarantees for revenue‐ordered assortments. We extend our model to the multi‐period capacity allocation problem, and prove that, when restricted to the revenue‐ordered assortments, the mixture‐of‐logits model possesses the nesting‐by‐fare‐order property. This result implies that revenue‐ordered assortments can be incorporated into existing revenue management systems through nested protection levels. Numerical experiments show that revenue‐ordered assortments perform remarkably well, generally yielding profits that are within a fraction of a percent of the optimal.     

A Single‐Period Assortment Optimization Model

This paper studies a single‐period assortment optimization problem with unequal cost parameters. The consumer choice process is characterized by a Multinomial Logit (MNL) model. When the store traffic is a continuous random variable, we explicitly derive the structure of the optimal assortment. Our approach is to use a comprehensive measure–profit rate to evaluate the profitability of each variant and then determine which product should be offered. We demonstrate that the optimal assortment contains the few items that have the highest profit rate. When the store traffic is discrete, the optimal solution is difficult to obtain. We propose a “profit rate” heuristic, which is inspired by the result for the case of continuous store traffic. In a special case with equal cost parameters and normal demand distribution, the profit rate heuristic is indeed optimal. Using randomly generated data, we test the effectiveness of the heuristic and find that the average percentage error is less than 0.1% and that the hit rate is above 90%. Our research provides managerial insights on assortment planning and accentuates the importance of measuring the profitability of each product when the demand is random and cannibalization among different products exists.     

Cost Allocation in Manufacturing–Remanufacturing Operations

For firms remanufacturing their products, the total life‐cycle costs and revenues from new and remanufactured products determine their profitability. In many firms, manufacturing/sales and remanufacturing/remarketing operations are carried out in different divisions. Each division is responsible for only part of the product's life cycle. Practices regarding transfer pricing across divisions vary significantly among companies, affecting the life‐cycle profit performance of the product. In this research, we identify characteristics of transfer prices that achieve the firm‐wide optimal solution. To this end, we consider a manufacturer who also undertakes remanufacturing operations and we focus on price (quantity) decisions. We determine that a cost allocation mechanism that allocates a portion of the initial production cost to each of the two stages of the product life cycle should be used. We also conclude that cost allocation should be implemented as a fixed cost allocation, where charges to the remanufacturing division should be determined independently of the actual quantity of units remanufactured.     

Sequence Matters: Shelf‐Space Allocation under Dynamic Customer‐Driven Substitution

Customers who face a stockout situation often decide to purchase a different product in the same category. We analyze the resulting dynamic substitution problem in a retail environment, where customers serve themselves from the store shelves, such that the sequence of customer arrivals affects how scarce products are allocated to customers. We consider a setting with constrained shelf space, and we study how a retailer should optimally allocate such space between substitute products. We characterize environments where the sequence of customer arrivals can have a substantial impact on profitability.     

Single‐Period Two‐Product Assemble‐to‐Order Systems with a Common Component and Uncertain Demand Patterns

We consider a single‐period assemble‐to‐order system that produces two types of end products to satisfy two independent and stochastic customer orders. Each type of product is used to fulfill a particular customer order and these two products share a common component. Furthermore, one customer may confirm her order before the other one, and the manufacturer needs to make a commitment immediately upon the receipt of each customer order on how many products to be delivered. We propose a model for optimizing the inventory and production decisions under the above ATO environment. We also extend our model to the situation where the manufacturer can fulfill the unsatisfied low‐priority demand using the left‐over inventories after fulfilling the high‐priority demand, in case the low‐priority customer arrives first. Numerical experiments are conducted, which provide some interesting insights on the impact of uncertain demand pattern.     

Competitive Pricing in a Multi‐Product Multi‐Attribute Environment

We address the problem of simultaneous pricing of a line of several products, both complementary products and substitutes, with a number of distinct price differentiation classes for each product (e.g., volume discounts, different distribution channels, and customer segments) in both monopolistic and oligopolistic settings. We provide a generic framework to tackle this problem, consider several families of demand models, and focus on a real‐world case‐study example. We propose an iterative relaxation algorithm, and state sufficient conditions for convergence of the algorithm. Using historical sales and price data from a retailer, we apply our solution algorithm to suggest optimal pricing, and report on numerical results.     

A NUMERICAL ANALYSIS OF CAPACITATED POSTPONEMENT

Customer satisfaction can be achieved by providing rapid delivery of a wide variety of products. High levels of product variety require correspondingly high levels of inventory of each item to quickly respond to customer demand. Delayed product differentiation has been identified as a strategy to reduce final product inventories while providing the required customer service levels. However, it is done so at the cost of devoting large production capacities to the differentiation stage. We study the impact of this postponement capacity on the ability to achieve the benefits of delayed product differentiation. We examine a single‐period capacitated inventory model and consider a manufacturing system that produces a single item that is finished into multiple products. After assembly, some amount of the common generic item is completed as non‐postponed products, whereas some of the common item is kept as in‐process inventory, thereby postponing the commitment to a specific product. The non‐postponed finished‐goods inventory is used first to meet demand. Demand in excess of this inventory is met, if possible, through the completion of the common items. Our results indicate that a relatively small amount of postponement capacity is needed to achieve all of the benefits of completely delaying product differentiation for all customer demand. This important result will permit many firms to adopt this delaying strategy who previously thought it to be either technologically impossible or prohibitively expensive to do so.     

The Role of Slotting Fees in the Coordination of Assortment Decisions

Large numbers of new products introduced annually by manufacturers may strain the relationship between retailers and manufacturers regarding assortments carried by retailers. For example, many retailers in the grocery industry will agree to broaden their assortments only if the manufacturer agrees to pay slotting fees for the new products. We investigate the role played by slotting fees in coordinating the assortment decisions in a supply chain. To do so, we study a single‐retailer, single‐manufacturer supply chain, where the retailer decides what assortment to offer to end customers. Double marginalization results in a discrepancy between the retailer's optimal assortment and the assortment that maximizes total supply chain profits. We consider a payment scheme that is analogous to slotting fees used in the grocery industry: the manufacturer pays the retailer a per‐product fee for every product offered by the retailer in excess of a certain target level. We show that, if the wholesale price is below some threshold level, this payment scheme induces the retailer to offer the supply‐chain‐optimal assortment and makes both parties better off.     

A Competitive Model of Customization with Lead‐Time Effects

In this article, we study the competitive interactions between a firm producing standard products and a firm producing custom products. Consumers with heterogeneous preferences choose between n standard products, which may not meet their preferences exactly but are available immediately, and a custom product, available only after a certain lead time l. Standard products incur a variety cost that increases with n and custom products incur a lead time cost that is decreasing in the lead time l. We consider a two‐stage game wherein at stage 1, the standard product firm chooses the variety and the custom firm chooses the lead time and then both firms set prices simultaneously. We characterize the subgame‐perfect Nash equilibrium of the game. We find that both firms can coexist in equilibrium, either sharing the market as local monopolists or in a price‐competitive mode. The standard product firm may offer significant or minimal variety depending on the equilibrium outcome. We provide several interesting insights on the variety, lead time, and prices of the products offered and on the impact of problem parameters on the equilibrium outcomes. For instance, we show that the profit margin and price of the custom product are likely to be higher than that of standard products in equilibrium under certain conditions. Also, custom firms are more likely to survive and succeed in product markets with larger potential market sizes. Another interesting insight is that increased consumer sensitivity to product fit may result in lower lead time for the custom product.     

Tractable Consideration Set Structures for Assortment Optimization and Network Revenue Management

Discrete‐choice models are widely used to model consumer purchase behavior in assortment optimization and revenue management. In many applications, each customer segment is associated with a consideration set that represents the set of products that customers in this segment consider for purchase. The firm has to make a decision on what assortment to offer at each point in time without the ability to identify the customer's segment. A linear program called the Choice‐based Deterministic Linear Program (CDLP) has been proposed to determine these offer sets. Unfortunately, its size grows exponentially in the number of products and it is NP‐hard to solve when the consideration sets of the segments overlap. The Segment‐based Deterministic Concave Program with some additional consistency equalities (SDCP+) is an approximation of CDLP that provides an upper bound on CDLP's optimal objective value. SDCP+ can be solved in a fraction of the time required to solve CDLP and often achieves the same optimal objective value. This raises the question under what conditions can one guarantee equivalence of CDLP and SDCP+. In this study, we obtain a structural result to this end, namely that if the segment consideration sets overlap with a certain tree structure or if they are fully nested, CDLP can be equivalently replaced with SDCP+. We give a number of examples from the literature where this tree structure arises naturally in modeling customer behavior.     

Assortment optimisation problem: A distribution-free approach

Assortment optimisation is a critical decision that is regularly made by retailers. The decision involves a trade-off between offering a larger assortment of products but smaller inventories of each product and offering a smaller number of varieties with more inventory of each product. We propose a robust, distribution-free formulation of the assortment optimisation problem such that the assortment and inventory levels can be jointly optimised without making specific assumptions on the demand distributions of each product. We take a max-min approach to the problem that provides a guaranteed lower bound to the expected profit when only the mean and variance of the demand distribution are known. We propose and test three heuristic algorithms that provide solutions in O(nlog (n)) time and identify two cases where one of the heuristics is guaranteed to return optimal policies. Through numerical studies, we demonstrate that one of the heuristics performs extremely well, with an average optimality gap of 0.07% when simulated under varying conditions. We perform a sensitivity analysis of product and store demand attributes on the performance of the heuristic. Finally, we extend the problem by including maximum cardinality constraints on the assortment size and perform numerical studies to test the performance of the heuristics.     

Integrated retail decisions with multiple selling periods and customer segments: Optimization and insights

Integrating retail decisions on such aspects as assortment, pricing, and inventory greatly improves profitability. We examine a multi-period selling horizon where a retailer jointly optimizes assortment planning, pricing, and inventory decisions for a product line of substitutable products, in a market with multiple customer segments. Focusing on fast-moving retail products, the problem is modeled as a mixed-integer nonlinear program where demand is driven by exogenous consumer reservation prices and endogenous assortment and pricing decisions. A mixed-integer linear reformulation is developed, which enables an exact solution to large problem instances (with up to a hundred products) in manageable times. Empirical evidence is provided in support of a classical deterministic maximum-surplus consumer choice model. Computational results and managerial insights are discussed. We find that the optimal assortment and pricing decisions do not exhibit a simple, intuitive structure that could be analytically characterized, which reflects the usefulness of optimization approaches to numerically identify attractive trade-offs for the decision-maker. We also observe that suboptimal inventory policies significantly decrease profitability, which highlights the importance of integrated decision-making. Finally, we find that the seasonality of consumer preferences and supply costs present an opportunity for boosting the profit via higher inventory levels and wider assortments.     

Managing Supply Risk for Vertically Differentiated Co‐Products

The manufacturing complexity of many high‐tech products results in a substantial variation in the quality of the units produced. After manufacturing, the units are classified into vertically differentiated products. These products are typically obtained in uncontrollable fractions, leading to mismatches between their demand and supply. We focus on product stockouts due to the supply–demand mismatches. Existing literature suggests that when faced with product stockouts, firms should satisfy all unmet demand of a low‐end product by downgrading excess units of a high‐end product (downward substitution). However, this policy may be suboptimal if it is likely that low‐end customers will substitute with a higher quality product and pay the higher price (upward substitution). In this study, we investigate whether and how much downward substitution firms should perform. We also investigate whether and how much low‐end inventory firms should withhold to strategically divert some low‐end demand to the high‐end product. We first establish the existence of regions of co‐production technology and willingness of customers to substitute upward where firms adopt different substitution/withholding strategies. Then, we develop a managerial framework to determine the optimal selling strategy during the life cycle of technology products as profit margins shrink, manufacturing technology improves, and more capacity becomes available. Consistent trends exist for exogenous and endogenous prices.     

An Auction Mechanism for Pricing and Capacity Allocation with Multiple Products

We consider a pricing and short‐term capacity allocation problem in the presence of buyers with orders for bundles of products. The supplier's objective is to maximize her net profit, computed as the difference between the revenue generated through sales of products and the production and inventory holding costs. The objective of each buyer is similarly profit maximization, where a buyer's profit is computed as the difference between the time‐dependent utility of the product bundle he plans to buy, expressed in monetary terms, and the price of the bundle. We assume that bundles' utilities are buyers' private information and address the problem of allocating the facility's output. We directly consider the products that constitute the supplier's output as market goods. We study the case where the supplier follows an anonymous and linear pricing strategy, with extensions that include quantity discounts and time‐dependent product and delivery prices. In this setting, the winner determination problem integrates the capacity allocation and scheduling decisions. We propose an iterative auction mechanism with non‐decreasing prices to solve this complex problem, and present a computational analysis to investigate the efficiency of the proposed method under supplier's different pricing strategies. Our analysis shows that the problem with private information can be effectively solved with the proposed auction mechanism. Furthermore, the results indicate that the auction mechanism achieves more than 80% of the system's profit, and the supplier receives a higher percentage of profit especially when the ratio of demand to available capacity is high.     

Ordering,Pricing, and Lead‐Time Quotation Under Lead‐Time and Demand Uncertainty

In this article, we study the newsvendor problem with endogenous setting of price and quoted lead‐time. This problem can be observed in situations where a firm orders semi‐finished product prior to the selling season and customizes the product in response to customer orders during the selling season. The total demand during the selling season and the lead‐time required for customization are uncertain. The demand for the product depends not only on the selling price but also on the quoted lead‐time. To set the quoted lead‐time, the firm has to carefully balance the benefit of increasing demand as the quoted lead‐time is reduced against the cost of increased tardiness. Our model enables the firm to determine the optimal selling price, quoted lead‐time, and order quantity simultaneously, and provides a new set of insights to managers.     

Joint product assortment,inventory and price optimization to attract loyal and non-loyal customers

In this paper, we analyze the emerging retail practice of carrying a combined product assortment consisting of both regular “standard” products and more fashionable and short-lived “special” products. The purpose of this practice is to increase store traffic by attracting heterogeneous classes of customers, which drives up sales of standard products due to the potential cross-selling effect. Customers who are primarily attracted by special products will also buy some standard products. In this context, we analyze three decisions that are crucial for a retailer׳s commercial success: the product assortment, the inventory levels and the pricing. We propose an optimization model and an iterative heuristic to analyze the trade-offs between the combined product assortment, the inventory level and the price per product when there is limited shelf space. Using numerical experiments, we show that our heuristic can be trusted and that its accuracy improves when the number of products increases. Our findings indicate that to attract more customers for standard products, a retailer may benefit from carrying low priced special products which, if considered in isolation, would be non-profitable. As the cross-selling effect decreases, a retailer should focus more on the standard assortment by increasing its size and decreasing the prices. However, introducing special products and ignoring the cross-selling effect may decrease a retailer׳s profitability. We show that the introduction of special products involves more than just choosing the right specials for non-loyal customers but impacts the global assortment planning, the standard products and the products pricing.     

A Model for Partial Product Complementarity and Strategic Production Decisions under Demand Uncertainty

This paper considers a general industrial setting where multiple manufacturers each produce a different product and sell it to the markets. These products are partially complementary in the sense that there is a common demand stream that requests all these products as complementary sets and there are streams of individual demands each requesting only one of the products. All demands are uncertain and may follow any general, joint distributions. Facing demand uncertainties, the manufacturers each choose a production quantity for its product with an objective to maximize its own expected profit. We formulate the problem as a non‐cooperative game to study the strategic interactions of such firms and their implications to supply chain performance. We show that such a game may have numerous equilibria. Among all the possible equilibria, however, we prove that there always exists a unique one that maximizes each and every manufacturer's profit, and we derive an explicit solution for this Pareto‐optimal equilibrium point. We further study the optimal solution for a centralized system and compare it with the decentralized solution. Managerial insights are drawn as to how system parameters and control mechanisms affect firms' decisions and performance.