An integrated decision making model for dynamic pricing and inventory control of substitutable products based on demand learning

Purpose: This paper focuses on the PC industry, analyzing a PC supply chain system composed of onelarge retailer and two manufacturers. The retailer informs the suppliers of the total order quantity, namelyQ, based on demand forecast ahead of the selling season. The suppliers manufacture products accordingto the predicted quantity. When the actual demand has been observed, the retailer conducts demandlearning and determines the actual order quantity. Under the assumption that the products of the twosuppliers are one-way substitutable, an integrated decision-making model for dynamic pricing andinventory control is established.Design/methodology/approach: This paper proposes a mathematical model where a large domestichousehold appliance retailer decides the optimal original ordering quantity before the selling season and theoptimal actual ordering quantity, and two manufacturers decide the optimal wholesale price.Findings:By applying this model to a large domestic household appliance retail terminal, the authors canconclude that the model is quite feasible and effective. Meanwhile, the results of simulation analysis showthat when the product prices of two manufacturers both reduce gradually, one manufacturer will often waittill the other manufacturer reduces their price to a crucial inflection point, then their profit will show aqualitative change instead of a real-time profit-price change.Practical implications: This model can be adopted to a supply chain system composed of one largeretailer and two manufacturers, helping manufacturers better make a pricing and inventory controldecision.Originality/value: Previous research focuses on the ordering quantity directly be decided. Limited workhas considered the actual ordering quantity based on demand learning. However, this paper considers boththe optimal original ordering quantity before the selling season and the optimal actual ordering quantityfrom the perspective of the retailerPeer Reviewe

Revenue Management In Manufacturing: A Research Landscape

Revenue management is the science of using past history and current levels of order activity to forecast demand as accurately as possible in order to set and update pricing and product availability decisions across various sales channels to maximize profitability. In much the same way that revenue management has transformed the airline industry in selling tickets for the same flight at markedly different rates based upon product restrictions, time to departure, and the number of unsold seats, many manufacturing companies have started exploring innovative revenue management strategies in an effort to improve their operations and profitability. These strategies employ sophisticated demand forecasting and optimization models that are based on research from many areas, including management science and economics, and that can take advantage of the vast amount of data available through customer relationship management systems in order to calibrate the models. In this paper, we present an overview of revenue management systems and provide an extensive survey of published research along a landscape delineated by three fundamental dimensions of capacity management, pricing, and market segmentation

Attainability in Repeated Games with Vector Payoffs

We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payoffs. A set of payoff vectors is called {\em attainable} if player 1 can ensure that there is a finite horizon $T$ such that after time $T$ the distance between the set and the cumulative payoff is arbitrarily small, regardless of what strategy player 2 is using. This paper focuses on the case where the attainable set consists of one payoff vector. In this case the vector is called an attainable vector. We study properties of the set of attainable vectors, and characterize when a specific vector is attainable and when every vector is attainable.Comment: 28 pages, 2 figures, conference version at NetGCoop 201

Pricing with Limited Knowledge of Demand

How should a firm price a new product for which little is known about demand? We propose a pricing rule that can be used if the firm can estimate (even roughly) the maximum price it can charge and still expect to sell some units, and the firm need not know in advance the quantity it will sell. The rule is simple: Set price as though the demand curve were linear. We show that if the true demand curve is one of many commonly used demand functions, or even a more complex function, and if marginal cost is known and constant, the firm can expect its profit to be close to what it would earn if it knew the true demand curve. We derive analytical performance bounds for a variety of demand functions, calculate expected profit performance for randomly generated demand curves, and evaluate the welfare implications of our pricing rule

A robust fuzzy possibilistic AHP approach for partner selection in international strategic alliance

The international strategic alliance is an inevitable solution for making competitive advantage and reducing the risk in today’s business environment. Partner selection is an important part in success of partnerships, and meanwhile it is a complicated decision because of various dimensions of the problem and inherent conflicts of stockholders. The purpose of this paper is to provide a practical approach to the problem of partner selection in international strategic alliances, which fulfills the gap between theories of inter-organizational relationships and quantitative models. Thus, a novel Robust Fuzzy Possibilistic AHP approach is proposed for combining the benefits of two complementary theories of inter-organizational relationships named, (1) Resource-based view, and (2) Transaction-cost theory and considering Fit theory as the perquisite of alliance success. The Robust Fuzzy Possibilistic AHP approach is a noveldevelopment of Interval-AHP technique employing robust formulation; aimed at handling the ambiguity of the problem and let the use of intervals as pairwise judgments. The proposed approach was compared with existing approaches, and the results show that it provides the best quality solutions in terms of minimum error degree. Moreover, the framework implemented in a case study and its applicability were discussed

SDP reformulation for robust optimization problems based on nonconvex QP duality

Abstract In a real situation, optimization problems often involve uncertain parameters. Robust optimization is one of distribution-free methodologies based on worst-case analyses for handling such problems. In this paper, we first focus on a special class of uncertain linear programs (LPs). Applying the duality theory for nonconvex quadratic programs (QPs), we reformulate the robust counterpart as a semidefinite program (SDP) and show the equivalence property under mild assumptions. We also apply the same technique to the uncertain second-order cone programs (SOCPs) with "single" (not side-wise) ellipsoidal uncertainty. Then we derive similar results on the reformulation and the equivalence property. In the numerical experiments, we solve some test problems to demonstrate the efficiency of our reformulation approach. Especially, we compare our approach with another recent method based on Hildebrand's Lorentz positivity

Inventory management based on target-oriented robust optimization

We propose a target-oriented robust optimization approach to solve a multiproduct, multiperiod inventory management problem subject to ordering capacity constraints. We assume the demand for each product in each period is characterized by an uncertainty set that depends only on a reference value and the bounds of the demand. Our goal is to find an ordering policy that maximizes the sizes of all the uncertainty sets such that all demand realizations from the sets will result in a total cost lower than a prespecified cost target. We prove that a static decision rule is optimal for an approximate formulation of the problem, which significantly reduces the computation burden. By tuning the cost target, the resultant policy can achieve a balance between the expected cost and the associated cost variance. Numerical experiments suggest that although only limited demand information is used, the proposed approach performs comparably to traditional methods based on dynamic programming and stochastic programming. More importantly, our approach significantly outperforms the traditional methods if the latter assume inaccurate demand distributions. We demonstrate the applicability of our approach through two case studies from different industries. This paper was accepted by Yinyu Ye, optimization. </jats:p