Operationalizing technology improvements in product development decision-making

Achieving competitive advantage and price premiums in many technology-based markets requires the incorporation of current technology in new products. To do so, firms in hyper-competitive environments increasingly plan and design their products concurrent with the independent development and validation of underlying technologies. Simultaneous validation of a core technology has important implications for a company’s product positioning and launch sequence decisions making these traditional marketing decisions relevant to operations managers. Prior research has shown that to minimize cannibalization in the absence of such improvements in technology, a firm should not launch low-end products before high-end products. However, concurrent evolution of technology can make it desirable and even necessary to introduce low-end products before high-end products. This is because in technology-based industries, improvements in technology delay the introduction of a high-end product, and a firm must trade-off the benefit of launching the low-end product earlier (greater discounted profits) against the cost of cannibalization of high-end product sales. High-end product cannibalization can be further reduced by offering the customer an option to upgrade from the low-end to high-end product, with important implications for the firm’s product positioning and introduction sequence decisions. Based on our study in the high technology industry, we model the product positioning and introduction sequence decisions under the simultaneous evolution of technology. Our analysis indicates that it may be optimal in a variety of circumstances for a firm to launch products in an increasing order of performance, even in the absence of network externalities. Besides presenting analytical results for product positioning and profit from different introduction sequences, the paper also makes a contribution to managerial practice by providing insights in the form of a conceptual framework.     

A pricing problem under Monge property

We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the largest utility, which is defined to be the difference between the benefit and the price of the item. The optimization problem is to decide on the prices that maximize total revenue of the seller. This problem is also called the optimal product line design problem in the absence of competition.

Even though the general problem is known to be NP-hard, it can be solved efficiently under some natural assumptions on customer benefits. In this paper we study properties of optimal solutions and present a dynamic programming algorithm when customer benefits satisfy the Monge property. The same algorithm can also be used to solve the problem under the additional requirement that all buyers should be served.     

Nash game model for optimizing market strategies,configuration of platform products in a Vendor Managed Inventory (VMI) supply chain for a product family

This paper discusses how a manufacturer and its retailers interact with each other to optimize their product marketing strategies, platform product configuration and inventory policies in a VMI (Vendor Managed Inventory) supply chain. The manufacturer procures raw materials from multiple suppliers to produce a family of products sold to multiple retailers. Multiple types of products are substitutable each other to end customers. The manufacturer makes its decision on raw materials’ procurement, platform product configuration, product replenishment policies to retailers with VMI, price discount rate, and advertising investment to maximize its profit. Retailers in turn consider the optimal local advertising investments and retail prices to maximize their profits. This problem is modeled as a dual simultaneous non-cooperative game (as a dual Nash game) model with two sub-games. One is between the retailers serving in competing retail markets and the other is between the manufacturer and the retailers. This paper combines analytical, iterative and GA (genetic algorithm) methods to develop a game solution algorithm to find the Nash equilibrium. A numerical example is conducted to test the proposed model and algorithm, and gain managerial implications.     

A resource portfolio planning model using sampling-based stochastic programming and genetic algorithm

Resource portfolio planning optimization is crucial to high-tech manufacturing industries. One of the most important characteristics of such a problem is intensive investment and risk in demands. In this study, a nonlinear stochastic optimization model is developed to maximize the expected profit under demand uncertainty. For solution efficiency, a stochastic programming-based genetic algorithm (SPGA) is proposed to determine a profitable capacity planning and task allocation plan. The algorithm improves a conventional two-stage stochastic programming by integrating a genetic algorithm into a stochastic sampling procedure to solve this large-scale nonlinear stochastic optimization on a real-time basis. Finally, the tradeoff between profits and risks is evaluated under different settings of algorithmic and hedging parameters. Experimental results have shown that the proposed algorithm can solve the problem efficiently.     

Product line selection and pricing analysis: Impact of genetic relaxations

A model for the product line selection and pricing problem (PLSP) is presented andthree solution procedures based on a genetic algorithm are developed to analyze the results based on consumer preference patterns. Since the PLSP model is nonlinear and integer, two of the solution procedures use genetic encoding to “relax” the NP hard model. The relaxations result in linear integer and shortest path models for the fitness evaluation which are solved using branch and bound and labeling algorithms, respectively. Performance of the quality of solutions generated by the procedures is evaluated for various problem sizes and customer preference structures. The results show that the genetic relaxations provide efficient and effective solution methodologies for the problem, when compared to the pure artificial intelligence technique of genetic search. The impact of the preference structure on the product line and the managerial implications of the solution characteristics generated by the genetic relaxations are also discussed. The models can be used to explicitly consider tradeoffs between marketing and operations concerns in designing a product line.     

汽车制造商分时租赁模式采用及产品线策略研究

考虑自有平台和第三方平台两种分时租赁方式,将汽车质量划分为性能质量和环境质量,构建销售模式、纯分时租赁模式和混合模式下的产品线策略模型,研究制造商产品线策略与商业模式之间的相互作用。研究发现,同品牌产品间竞争和合并效应是分时租赁模式影响产品线策略的两个关键因素。同品牌产品间竞争的加剧和合并效应的增大都会激励企业选择性能更好的车型而忽略其环境表现。分时租赁模式能同时改进利润与产品环境表现,但存在条件:当消费者价格敏感性较低时,使用成本高且合并效应小是实现同时改进的条件;当消费者价格敏感较高时,使用成本低且合并效应小则是同时改进的条件。     

A Sequential Algorithm for an Inventory Selection Problem

Assume that we have m finished products in an inventory. Eachfinished product is characterized by two measurements P andQ. A customer specifies a purchase order by the requirementsof characteristics P and Q. A product is qualified to satisfya purchase order if and only if it possesses better measurementsof both P and Q than the customer requires. For a given batchof n purchase orders, the inventory selection problem is tochoose n finished products from the inventory to satisfy allpurchase orders with a minimum cost. This problem can be formulatedas a large-scale transportation problem. When the cost functionof selecting a product to satisfy an order exhibits certainstructure, we develop a fast sequential algorithm to solve thisproblem. Possible extensions and related problems are also discussedin this paper.     

Product line selection and pricing under a share-of-surplus choice model

Product line selection and pricing decisions are critical to the profitability of many firms, particularly in today’s competitive business environment in which providers of goods and services are offering a broad array of products to satisfy customer needs.We address the problem of selecting a set of products to offer and their prices when customers select among the offered products according to a share-of-surplus choice model. A customer’s surplus is defined as the difference between his utility (willingness to pay) and the price of the product. Under the share-of-surplus model, the fraction of a customer segment that selects a product is defined as the ratio of the segment’s surplus from this particular product to the segment’s total surplus across all offered products with positive surplus for that segment.We develop a heuristic procedure for this non-concave, mixed-integer optimization problem. The procedure utilizes simulated annealing to handle the binary product selection variables, and a steepest-ascent-style procedure that relies on certain structural properties of the objective function to handle the non-concave, continuous portion of the problem involving the prices. We also develop a variant of our procedure to handle uncertainty in customer utilities. In computational studies, our basic procedures perform extremely well, producing solutions whose objective values are within about 5% of those obtained via enumerative methods. Our procedure to handle uncertain utilities also performs well, producing solutions with expected profit values that are roughly 10% higher than the corresponding expected profits from solutions obtained under the assumption of deterministic utilities.     

Comparison and hybridization of crossover operators for the nurse scheduling problem

In this paper, we present a hybrid genetic algorithm for the well-known nurse scheduling problem (NSP). The NSP involves the construction of roster schedules for nursing staff in order to maximize the quality of the roster schedule subject to various hard constraints. In the literature, several genetic algorithms have been proposed to solve the NSP under various assumptions. The contribution of this paper is twofold. First, we extensively compare the various crossover operators and test them on a standard dataset in a solitary approach. Second, we propose several options to hybridize the various crossover operators.     

Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning

This paper investigates dynamic order acceptance and capacity planning under limited regular and non-regular resources. Our goal is to maximize the profits of the accepted projects within a finite planning horizon. The way in which the projects are planned affects their payout time and, as a consequence, the reinvestment revenues as well as the available capacity for future arriving projects. In general, project proposals arise dynamically to the organization, and their actual characteristics are only revealed upon arrival. Dynamic solution approaches are therefore most likely to obtain good results. Although the problem can theoretically be solved to optimality as a stochastic dynamic program, real-life problem instances are too difficult to be solved exactly within a reasonable amount of time. Efficient and effective heuristics are thus required that supply a response without delay. For this reason, this paper considers both ‘single-pass’ algorithms as well as approximate dynamic-programming algorithms and investigates their suitability to solve the problem. Simulation experiments compare the performance of our procedures to a first-come, first-served policy that is commonly used in practice.     

The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers

In the mathematical model under study, the two competing sides consecutively place their facilities aiming to capture consumers and maximize profits. The model amounts to a bilevel integer programming problem. We take the optimal noncooperative solutions as optimal to this problem. To find approximate and optimal solutions, we propose a branch-and-bound algorithm. Simulations show that the algorithm can be applied to solve the individual problems of low and medium dimension.     

包含随机客户的选择性旅行商问题建模及求解

针对快递配送过程中客户需求具有不确定性的特征,提出一种新的路径优化问题——包含随机客户的选择性旅行商问题,在该问题中客户每天是否具有配送需求存在一定概率,并且对客户进行配送可获取一定利润。同时考虑以上两种因素,建立该问题的数学模型, 目标为在满足行驶距离限制的条件下,找出一条经过部分客户的预优化路径,使得该路径的期望利润最大。其可用于模拟构建最后一公里快递配送的路径问题,提供更具有经济效益的配送路径。随后提出包含精细化局部搜索策略的改进遗传算法,算法根据问题特点构建初始可行解。最后通过多个计算比对结果表明,该算法具有较高的计算效率。     

Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network

This paper addresses a generalization of the capacitated location-routing problem (CLRP) arising in the design of a collection network for a company engaged in collecting used products from customer zones. The company offers customers a financial incentive per unit of used products. This incentive determines the quantity of used products which are returned by customers. Moreover, it is not necessary for the company to visit all customer zones or to collect all returns in each visited customer zone. The objective is to simultaneously find the location of collection centers, the routes of vehicles, the value of incentive offered and the amount of used products collected from customer zones, so as to maximize the company's overall profit. We develop two mixed integer linear programming formulations of the problem and a heuristic algorithm based on iterated local search. Extensive computational experiments on this problem demonstrate the effectiveness of the proposed algorithm.     

Assortment planning in fashion retailing: methodology,application and analysis

Assortment planning is the process conducted by the retailer to determine the number and types of products in a line. Key questions that arise in this process include choosing the inventory depth and variety breadth, and the mix between basic and fashion merchandise of the assortment to maximize expected profits. We describe a method for resolving these questions. Using demand forecasts derived from historical sales patterns, we use a nonlinear integer programming model to make the assortment choice. Efficient heuristics are developed to solve this problem. We applied our method at a large catalog retailer specializing in women’s apparel. We compared our method to the existing rules used by this retailer and found that it could choose the assortment in a manner that reduces markdowns due to excessive inventory and lost margins due to stockouts by enough to increase profits by at least 40%. Insights are developed to better understand why products are included in an assortment and the implications of this choice on the realized profit. We extend our model to include shelf space constraints and the effect of assortment choice on product demand.     

Extrapolation of Weighted norm inequalities for multivariable operators and applications

Two versions of Rubio de Francia’s extrapolation theorem for multivariable operators of functions are obtained. One version assumes an initial estimate with different weights in each space and implies boundedness on all products of Lebesgue spaces. Another version assumes an initial estimate with the same weight but yields boundedness on a product of Lebesgue spaces whose indices lie on a line. Applications are given in the context of multilinear Calderón-Zygmund operators. Vector-valued inequalities are automatically obtained for them without developing a multilinear Banach-valued theory. A multilinear extension of the Marcinkiewicz and Zygmund theorem on ℓ²-valued extensions of bounded linear operators is also obtained.     

Maximum utility product pricing models and algorithms based on reservation price

We consider a revenue management model for pricing a product line with several customer segments under the assumption that customers’ product choices are determined entirely by their reservation prices. We highlight key mathematical properties of the maximum utility model and formulate it as a mixed-integer programming problem, design heuristics and valid cuts. We further present extensions of the models to deal with various practical issues arising in applications. Our computational experiments with real data from the tourism sector as well as with the randomly generated data show the effectiveness of our approach.     

A branch and price solution approach for order acceptance and capacity planning in make-to-order operations

Make-to-order (MTO) operations have to effectively manage their capacity to make long-term sustainable profits. This objective can be met by selectively accepting available customer orders and simultaneously planning for capacity. We model a MTO operation of a job-shop with multiple resources having regular and non-regular capacity. The MTO firm has a set of customer orders at time zero with fixed due-dates. The process route, processing times, and sales price for each order are given. Since orders compete for limited resources, the firm can only accept some orders. In this paper a Mixed-Integer Linear Program (MILP) is proposed to aid an operational manager to decide which orders to accept and how to allocate resources such that the overall profit is maximized. A branch-and-price (B&P) algorithm is devised to solve the MILP effectively. The MILP is first decomposed into a master problem and several sub-problems using Dantzig-Wolfe decomposition. Each sub-problem is represented as a network flow problem and an exact procedure is proposed to solve the sub-problems efficiently. We also propose an approximate B&P scheme, Lagrangian bounds, and approximations to fathom nodes in the branch-and-bound tree. Computational analysis shows that the proposed B&P algorithm can solve large problem instances with relatively short time.     

Multi-objective genetic algorithm for single machine scheduling problem under fuzziness

This paper presents a new multi-objective approach to a single machine scheduling problem in the presence of uncertainty. The uncertain parameters under consideration are due dates of jobs. They are modelled by fuzzy sets where membership degrees represent decision maker’s satisfaction grade with respect to the jobs’ completion times. The two objectives defined are to minimise the maximum and the average tardiness of the jobs. Due to fuzziness in the due dates, the two objectives become fuzzy too. In order to find a job schedule that maximises the aggregated satisfaction grade of the objectives, a hybrid algorithm that combines a multi-objective genetic algorithm with local search is developed. The algorithm is applied to solve a real-life problem of a manufacturing pottery company.     

A model of product line design and introduction sequence with reservation utility

Cannibalization is a major concern for a firm when designing a product line. In addition, external options from outside the firm’s product line may also play a significant role. In this paper, we investigate the impact of external options, represented by reservation utility, on product line design and introduction sequence. We find that: (a) heterogeneous reservation utility defines the relative attractiveness of segments and corresponding product line; (b) reservation utility makes it more favorable to introduce products sequentially rather than simultaneously; (c) aggregating segments is an effective way to mitigate cannibalization when it becomes too difficult to manage with different values of reservation utility across multiple segments; and (d) introducing products in a non-monotone order of quality can improve profit from simultaneous introduction when the value of reservation utility of a middle segment is particularly high.     

A supply chain under limited-time promotion: The effect of customer sensitivity

We consider a two-echelon supply chain with a supplier and a retailer facing stochastic customer demands. The supplier is a leader who determines a wholesale price. In response, the retailer orders products and sets a price which affects customer demands. The goal of both players is to maximize their profits. We find the Stackelberg equilibrium and show that it is unique, not only when the supply chain is in a steady-state but also when it is in a transient state induced by a supplier’s promotion. There is a maximum length to the promotion, however, beyond which the equilibrium ceases to exist. Moreover, if customer sensitivity increases, then the wholesale equilibrium price decreases, product orders increase and product prices drop. This effect, well-observed in real life, does not, however, necessarily imply that the promotion is always beneficial. Conditions for the profitability of a limited-time promotion are shown and analyzed numerically. We discuss both open-loop and feedback policies and derive the conditions necessary for them to remain optimal under stochastic demand fluctuations.