A new model and solution method for product line design with pricing

Existing customer preference based product design models do not consider product prices and consumer budgets. These models assume that a purchase is based only on the satisfaction obtained from the product, irrespective of the product price and customer budget. However, when products are expensive relative to buyers' budgets, the effect of prices and budgets must be considered in addition to customer satisfaction. Most current models, moreover, assume that a low preference for one product characteristic is compensated by high preference for another, which may not hold for unacceptable levels of characteristics. For such products, we incorporate prices, budget constraints, and minimum acceptable thresholds in our model. To solve the model we develop a highly accurate, robust and efficient Beam Search (BS) based heuristic that identifies optimal or near optimal product lines. The heuristic is tested on 300 simulated problems and an application. It is also compared to a Genetic Algorithms (GA) based heuristic. We found that our heuristic worked better than the GA heuristic in identifying optimal and near optimal solutions quickly. We also give detailed examples that illustrate the heuristic and demonstrate a pricing analysis application of the model.     

Integration of pricing and capacity allocation for perishable products

For years pricing and capacity allocation decisions in most revenue management models have been carried out independently. This article presents a comprehensive model to integrate these two decisions for perishable products. We assume that the supplier sells the same products to different micro-markets at distinct prices. Throughout the sales season, the supplier faces decisions as to which micro-markets or customer classes should be served and at what prices. We show that (i) at any time, a customer class is active (being served) if and only if the price offered is over a threshold level, but the optimal price may not be the highest one of the supplier’s choice; (ii) when the price decision is made in conjunction with inventory, it is similar to the procedure shown in pure pricing models, i.e., the optimal price comes from a subset of prices that forms a maximum increasing concave envelope; (iii) because of dynamic changes in the optimal prices, the nested-price structure does not necessarily hold in general and needs to be redefined; and (iv) the optimal pricing and capacity control policy is based on a sequence of threshold points that incorporate inventory, price and demand intensity. Numerical examples are provided.     

Product line pricing for services with capacity constraints and dynamic substitution

In this paper, we address a service provider’s product line pricing problem for substitutable products in services, such as concerts, sporting events, or online advertisements. For each product, a static price is selected from a pre-defined set such that the total revenue is maximised. The products are differentiated by some of their attributes, and their availability is restricted due to individual capacity constraints. Furthermore, they are simultaneously sold during a common selling period at the end of which the service is delivered. Consumers differ from one another with respect to their willingness to pay, and, hence, their reservation prices vary depending on the product. In the event of a purchase, they choose the product that maximises their consumer surplus.     

Structured products equilibria in conic two price markets

A novel equilibrium theory is developed for two price markets permitting investors to trade personally designed structured products. Classical market clearing is enhanced for structured products where the market allows these products to be freely bought at ask prices or sold for bid prices. Competitive pressures lead the market to lower the ask prices and raise the bid prices with the market offering individual investors the widest possible set of acceptable risks provided the aggregate counter cash flow held by the market is consistent with a more conservative prespecified set of acceptable risks. We learn that in equilibrium heterogeneous investors inherit a common hedging objective of maximizing the bid prices of the final structured product sold to market or equivalently minimizing the ask price of what is bought.     

A Markov model for single-leg air cargo revenue management under a bid-price policy

In this paper, we consider the capacity allocation problem in single-leg air cargo revenue management. We assume that each cargo booking request is endowed with a random weight, volume and profit rate and propose a Markovian model for the booking request/acceptance/rejection process. The decision on whether to accept the booking request or to reserve the capacity for future bookings follows a bid-price control policy. In particular, a cargo will be accepted only when the revenue from accepting it exceeds the opportunity cost, which is calculated based on bid prices. Optimal solutions are derived by maximizing a reward function of a Markov chain. Numerical comparisons between the proposed approach and two existing static single-leg air cargo capacity allocation policies are presented.     

Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves

Consider a marketplace operated by a buyer who wishes to procure large quantities of several heterogeneous products. Suppliers submit price curves for each of the commodities indicating the price charged as a function of the supplied quantity. The total amount paid to a supplier is the sum of the prices charged for the individual commodities. It is assumed that the submitted supply curves are piecewise linear as they often are in practice. The bid evaluation problem faced by the procurer is to determine how much of each commodity to buy from each of the suppliers so as to minimize the total purchase price. In addition to meeting the demand, the buyer may impose additional business requirements that restrict which contracts suppliers may be awarded. These requirements may result in interdependencies between the commodities which lead to suboptimal results if the commodities are traded in independent auctions rather than simultaneously. Even without the additional business constraints the bid evaluation problem is NP-hard. The main contribution of our study is a flexible column generation based heuristics that provides near-optimal solutions to the procurer’s bid evaluation problem. Our method scales very well due to the Branch-and-Price technology it is built on. We employ sophisticated rounding and local improvement heuristics to obtain quality solutions. We also developed a test data generator that produces realistic problems and allows control over the difficulty level of the problems using parameters.     

Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly

This paper analyzes the impact of dynamic and fixed-ratio pricing policies on firm profits and equilibrium prices under competition. Firms that have equal inventories of perfectly substitutable and perishable products compete for customer segments that demand the product at different times. In each period, customers first purchase from the low price firm and then from the high price firm up to their inventories, provided the prices are lower than the maximum they are willing to pay. The main conclusions of this paper are as follows: although dynamic pricing is a more sophisticated policy than fixed-ratio pricing, it may lead to decreased equilibrium profits; under both pricing policies, one firm assumes the role of a low-cost high-output firm while the other assumes the role of a high-cost low-output firm; and, the supply demand ratio has more impact on the outcome of the competition than the heterogeneity in consumer reservation prices.     

Dynamic simultaneous fare proration for large-scale network revenue management

Network revenue management is concerned with managing demand for products that require inventory from one or several resources by controlling product availability and/or prices in order to maximize expected revenues subject to the available resource capacities. One can tackle this problem by decomposing it into resource-level subproblems that can be solved efficiently, for example by dynamic programming. We propose a new dynamic fare proration method specifically having large-scale applications in mind. It decomposes the network problem by fare proration and solves the resource-level dynamic programs simultaneously using simple, endogenously obtained dynamic marginal capacity value estimates to update fare prorations over time. An extensive numerical simulation study demonstrates that the method results in tightened upper bounds on the optimal expected revenue, and that the obtained policies are very effective with regard to achieved revenues and required runtime.     

Strategic and operational decisions in restaurant revenue management

The paper addresses restaurant revenue management from both a strategic and an operational point of view. Strategic decisions in restaurants are mainly related to defining the most profitable combination of tables that will constitute the restaurant. We propose new formulations of the so-called “Tables Mix Problem” by taking into account several features of the real setting. We compare the proposed models in a computational study showing that restaurants, with the capacity of managing tables as renewable resources and of combining different-sized tables, can improve expected revenue performances. Operational decisions are mainly concerned with the more profitable assignment of tables to customers. Indeed, the “Parties Mix Problem” consists of deciding on accepting or denying a booking request from different groups of customers, with the aim of maximizing the total expected revenue. A dynamic formulation of the “Parties Mix Problem” is presented together with a linear programming approximation, whose solutions can be used to define capacity control policies based on booking limits and bid prices. Computational results compare the proposed policies and show that they lead to higher revenues than the traditional strategies used to support decision makers.     

Pricing and market segmentation using opaque selling mechanisms

In opaque selling certain characteristics of the product or service are hidden from the consumer until after purchase, transforming a differentiated good into somewhat of a commodity. Opaque selling has become popular in service pricing as it allows firms to sell their differentiated products at higher prices to regular brand loyal customers while simultaneously selling to non-loyal customers at discounted prices. We develop a stylized model of consumer choice that illustrates the role of opaque selling in market segmentation. We model a firm selling a product via three selling channels: a regular full information channel, an opaque posted price channel and an opaque bidding channel where consumers specify the price they are willing to pay. We illustrate the segmentation created by opaque selling as well as compare optimal revenues and prices for sellers using regular full information channels with those using opaque selling mechanisms in conjunction with regular channels. We also study the segmentation and policy changes induced by capacity constraints.     

An analytical model for reverse automotive production planning and pricing

Automotive shredders need a reverse production planning strategy that includes determining at what price to purchase vehicle hulks from different sources. In this paper, we formulate the automotive reverse production planning and pricing problem in a nonlinear programming model, develop an approximate supply function for hulks when adjacent shredders price independently, and compare two hulk pricing strategies in three trends for ferrous metal and hulk prices: constant, increasing and decreasing. The case study results indicate that adjusting purchase price based on hulk composition in coordination with planning for purchasing, storing and processing can increase net revenue by 7–15%.     

有不公开底价英式拍卖的非时齐Markov链模型

对有不公开底价的英格兰式拍卖,建立了非时齐Markov链数学模型．对此模型,求出了拍卖的成交概率、平均成交价、成交时应价次数和成交价的联合概率分布以及边缘分布．     

An examination of the role of price insurance products in stimulating investment in agriculture supply chains for sustained productivity

This study examines how managing risk by introducing commodity price insurances may improve the likelihood of increased investment in agri-food supply chains. A model is introduced which shows how insurance products on index prices can reduce the uncertainty of the impact of investment, and also how lower investment can generate the same impact as a higher investment. To show our results, we use two different frameworks which include total profit (Pareto optimal) and Stackelberg game setups. The results demonstrate that in both frameworks the investment will have a greater impact when an insurance product is present. By implication, the study presents an encouraging message to the insurance industry to introduce products to secure supply chain actors’ revenue leading to an increase in investment rate. Consequently, the study offers insight into how the role of traditional government subsidies for protecting farmers, particularly the small to medium-sized farms, may be revisited by replacing some of the existing subsidisation policies with revenue insurance.     

Large-Scale Joint Price-Inventory Decision Problems, Under Resource Limitation and a Discrete Price Set

This article addresses a generalization of the capacitated lot-size problem (CLSP) as well as the profit maximization capacitated lot-size problem (PCLSP) considering joint price inventory decisions. This problem maximizes profit over a discrete set of prices subject to resource limitations. We propose a heuristic based on Lagrangian relaxation to resolve the problem, especially aiming for large scale cases. Results of experimentation exhibit the major importance of the capacity constraint. When this one is weak, our heuristic performs particularly well, moreover the numbers of possible prices does not really impact the results.     

Inventory control by different service levels

This paper examines the multiple period inventory control problem of a single product with multiple (two) prices, depending on service level, in which optimal pricing and ordering decisions are made in each period. Traditional inventory and pricing models consider only single products, single prices, and single service levels. However, this research paper finds that a seller can improve inventory control and revenue by offering multiple prices depending on service level. This research considers a single product with multiple (two) pricing policies corresponding to service level as follows: if the customer is willing to delay the shipment, he/she will be offered a lower regular price. Otherwise, the customer will pay the regular price plus extra charges for express service. In this paper, I show the following: (1) there is an optimal pricing and replenishment policy that can control inventory and (2) there exists a finite threshold for inventory levels such that if the inventory level at the beginning of each period is higher than the threshold, the customer will be offered the express service at the regular price, without any extra charge.     

Design of discrete Dutch auctions with an uncertain number of bidders

The focus of this paper is on Dutch auctions where the bidding prices are restricted to a finite set of values and the number of bidders follows a Poisson distribution. The goal is to determine what the discrete bid levels should be to maximize the auctioneer’s expected revenue, which is the same as the average selling price of the object under consideration. We take a new approach to the problem by formulating the descending-price competitive bidding process as a nonlinear program. The optimal solution indicates that the interval between two successive bids should be wider as the Dutch auction progresses. Moreover, the auctioneer’s maximum expected revenue increases with the number of bid levels to be set as well as the expected number of bidders. Numerical examples are provided to illustrate the key results from this study and their managerial implications are discussed.     

Network revenue management with inventory-sensitive bid prices and customer choice

We develop an approximate dynamic programming approach to network revenue management models with customer choice that approximates the value function of the Markov decision process with a non-linear function which is separable across resource inventory levels. This approximation can exhibit significantly improved accuracy compared to currently available methods. It further allows for arbitrary aggregation of inventory units and thereby reduction of computational workload, yields upper bounds on the optimal expected revenue that are provably at least as tight as those obtained from previous approaches. Computational experiments for the multinomial logit choice model with distinct consideration sets show that policies derived from our approach can outperform some recently proposed alternatives, and we demonstrate how aggregation can be used to balance solution quality and runtime.     

基于在线评论的多个竞争制造商和零售商的产品定价策略

在线评论作为一种产品信息传播载体,越来越受到网上电商及消费者的重视,并在很大程度上影响消费者的购买决策。本文在多个竞争性制造商为在线零售商提供可替代性产品并通过零售商销售给网络消费者的电子商务环境下,研究在线评论信息如何影响网络消费者购买决策及在线零售商和制造商的定价策略。以neo-Hoteling模型为基础,构建了依赖零售渠道在线评论的消费者选择模型,并通过模型求解定量分析了二级供应链结构分散系统下在线评论对多个竞争性制造商及零售商最优决策的影响。得到当制造商基于评论制定最优定价策略时,在线评论对市场竞争强度没有影响,但决定潜在市场大小;各产品的均衡批发价及销售价按一定的比例随评论揭示的该产品与其他产品质量均值之差(正或负)增加或减少,评论信息通常会使制造商因好评而获利,由于评论增加了不同产品需求的不对称性,零售商因而具有更大的调价空间,往往通过提高(降低)占据有利(不利)评论的产品价格获得更高的利润。     

All-pay auctions with pre- and post-bidding options

Motivated by the emergence of online penny or pay-to-bid auctions, in this study, we analyze the operational consequences of all-pay auctions competing with fixed list price stores. In all-pay auctions, bidders place bids, and highest bidder wins. Depending on the auction format, the winner pays either the amount of their bid or that of the second-highest bid. All losing bidders forfeit their bids, regardless of the auction format. Bidders may visit the store, both before and after bidding, and buy the item at the fixed list price. In a modified version, we consider a setting where bidders can use their sunk bid as a credit towards buying the item from the auctioneer at a fixed price (different from the list price). We characterize a symmetric equilibrium in the bidding/buying strategy and derive optimal list prices for both the seller and auctioneer to maximize expected revenue. We consider two situations: (1) one firm operating both channels (i.e. fixed list price store and all-pay auction), and (2) two competing firms, each operating one of the two channels.     

Dual sourcing using capacity reservation and spot market: Optimal procurement policy and heuristic parameter determination

This contribution focuses on the cost-effective management of the combined use of two procurement options: the short-term option is given by a spot market with random price, whereas the long-term alternative is characterized by a multi period capacity reservation contract with fixed purchase price and reservation level. A reservation cost, proportional with the reservation level, has to be paid for the option of receiving any amount per period up to the reservation level. A long-term decision has to be made regarding the reserved capacity level, and then it has to be decided – period by period – which quantities to procure from the two sources. Considering the multi-period problem with stochastic demand and spot price, the structure of the optimal combined purchasing policy is derived using stochastic dynamic programming. Exploiting these structural properties, an advanced heuristic is developed to determine the respective policy parameters. This heuristic is compared with two rolling-horizon approaches which use the one-period and two-period optimal solution. A comprehensive numerical study reveals that the approaches based on one-period and two-period solutions have considerable drawbacks, while the advanced heuristic performs very well compared to the optimal solution. Finally, by exploiting our numerical results we give some insights into the system’s behavior under problem parameter variations.