New product introduction against a predator: a bilevel mixed-integer programming approach. (English) Zbl 1177.90236
Summary: We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader’s goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader’s profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem.
MSC:
| 90B60 | Marketing, advertising |
| 90C11 | Mixed integer programming |
| 91B26 | Auctions, bargaining, bidding and selling, and other market models |
| 91A80 | Applications of game theory |
References:
| [1] | Alarie, Concavity cuts for disjoint bilinear programming, Math Program 90 pp 373– (2001) · Zbl 0989.90106 · doi:10.1007/PL00011428 |
| [2] | Alptekinoğlu, Mass customization versus mass production: Variety and price competition, Manufact Service Oper Manage 10 pp 204– (2008) · doi:10.1287/msom.1070.0155 |
| [3] | Audet, A symmetrical linear maxmin approach to disjoint bilinear programming, Math Program 85 pp 573– (1999) · Zbl 0980.90051 · doi:10.1007/s101070050072 |
| [4] | Balakrishnan, Telecommunication link restoration planning with multiple facility types, Ann Oper Res 106 pp 127– (2001) · Zbl 1020.90011 · doi:10.1023/A:1014509708610 |
| [5] | Balasubramanian, Mail versus mall: A strategic analysis of competition between direct marketers and conventional retailers, Market Sci 17 pp 181– (1998) · doi:10.1287/mksc.17.3.181 |
| [6] | Bayus, Truth or consequences: An analysis of vaporware and new product announcements, J Market Res 38 pp 3– (2001) · doi:10.1509/jmkr.38.1.3.18834 |
| [7] | Bertsimas, A new algebraic geometry algorithm for integer programming, Management Sci 46 pp 999– (2000) · Zbl 1231.13026 · doi:10.1287/mnsc.46.7.999.12033 |
| [8] | Champsaur, Multiproduct duopolists, Econometrica 57 pp 533– (1989) · doi:10.2307/1911051 |
| [9] | Chawla, Min-max payoffs in a two-player location game, Oper Res Lett 34 pp 499– (2006) · Zbl 1133.91320 · doi:10.1016/j.orl.2005.10.002 |
| [10] | Dasci, A continuous model for multistore competitive location, Oper Res 53 pp 263– (2005) · Zbl 1165.90535 · doi:10.1287/opre.1040.0175 |
| [11] | Dobson, Positioning and pricing a product line, Market Sci 7 pp 107– (1988) · doi:10.1287/mksc.7.2.107 |
| [12] | Dobson, Product offering, pricing, and make-to-stock/make-to-order decisions with shared capacity, Product Oper Manage 11 pp 293– (2002) |
| [13] | Donnelly, Flying sybaritic skies, Time (2000) |
| [14] | Garey, Computers and intractability: A guide to the theory of NP-completeness (1979) · Zbl 0411.68039 |
| [15] | Gaur, Assortment planning and inventory decisions under a locational choice model, Management Sci 52 pp 1528– (2006) · Zbl 1232.90050 · doi:10.1287/mnsc.1060.0580 |
| [16] | Gundlach, Predatory practices in competitive interaction: Legal limits and antitrust considerations, J Public Policy Market 9 pp 129– (1990) |
| [17] | Gupta, How does product proliferation affect responsiveness, Management Sci 44 pp 1017– (1998) · Zbl 0988.90507 · doi:10.1287/mnsc.44.7.1017 |
| [18] | Hauser, Defensive marketing strategies, Market Sci 2 pp 319– (1983) · doi:10.1287/mksc.2.4.319 |
| [19] | Ho, Product variety management: Research advances (1998) |
| [20] | Hotelling, Stability in competition, Economic J 39 pp 41– (1929) · JFM 54.0575.04 · doi:10.2307/2224214 |
| [21] | E. Iwata Owner of small coffee shop takes on java titan Starbucks 2006 |
| [22] | A. G. Kok M. L. Fisher R. Vaidyanathan Assortment planning: Review of literature and industry practice 2006 |
| [23] | Konno, A cutting plane algorithm for solving bilinear programs, Math Program 11 pp 14– (1976) · Zbl 0353.90069 · doi:10.1007/BF01580367 |
| [24] | Lancaster, The economics of product variety: A survey, Market Sci 9 pp 189– (1990) · doi:10.1287/mksc.9.3.189 |
| [25] | Lasserre, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J Optim 12 pp 756– (2002) · Zbl 1007.90046 · doi:10.1137/S1052623400380079 |
| [26] | Lee, Modelling the costs and benefits of delayed product differentiation, Management Sci 43 pp 40– (1997) · Zbl 0889.90108 · doi:10.1287/mnsc.43.1.40 |
| [27] | Lim, Transportation procurement with seasonally varying shipper demand and volume guarantees, Oper Res 56 pp 758– (2008) · Zbl 1167.90382 · doi:10.1287/opre.1070.0481 |
| [28] | Lim, Algorithms for discrete and continuous multicommodity flow network interdiction problems, IIE Transactions 39 pp 15– (2007) · doi:10.1080/07408170600729192 |
| [29] | Maddah, Joint pricing, assortment, and inventory decisions for a retailer’s product line, Naval Res Logistics 54 pp 315– (2007) · Zbl 1149.90305 · doi:10.1002/nav.20209 |
| [30] | Mahajan, Inventory competition under dynamic consumer choice, Oper Res 49 pp 5– (2001) · Zbl 1163.90340 · doi:10.1287/opre.49.5.646.10603 |
| [31] | McBride, An integer programming approach to the optimal product line selection problem, Market Sci 7 pp 126– (1988) · doi:10.1287/mksc.7.2.126 |
| [32] | Morgan, Marketing/manufacturing trade-offs in product line management, IIE Transactions 33 pp 949– (2001) · doi:10.1080/07408170108936886 |
| [33] | B. Mutzabaugh American considers joining Southwest at Dallas Love 2005 |
| [34] | Ordover, An economic definition of predation: Pricing and product innovation, Yale Law J 91 pp 8– (1981) · doi:10.2307/795848 |
| [35] | Pittman, Predatory investment: U.S. vs. IBM, Int J Indust Organ 2 pp 341– (1984) · doi:10.1016/0167-7187(84)90004-3 |
| [36] | Ramdas, Managing product variety: An integrative review and research directions, Product Oper Manage 12 pp 79– (2003) |
| [37] | Ratchford, Marketing applications of the economics of product variety, Market Sci 9 pp 207– (1990) · doi:10.1287/mksc.9.3.207 |
| [38] | Rhim, Competitive location, production, and market selection, Eur J Oper Res 149 pp 211– (2003) · Zbl 1032.91097 · doi:10.1016/S0377-2217(02)00445-9 |
| [39] | Sherali, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Math Program 19 pp 14– (1980) · Zbl 0436.90079 · doi:10.1007/BF01581626 |
| [40] | Sidak, Debunking predatory innovation, Columbia Law Rev 83 pp 1121– (1983) · doi:10.2307/1122427 |
| [41] | Smith, Survivable network design under optimal and heuristic interdiction scenarios, J Global Optim 38 pp 181– (2007) · Zbl 1179.90056 · doi:10.1007/s10898-006-9067-3 |
| [42] | Tayur, An algebraic geometry algorithm for scheduling in presence of setups and correlated demands, Math Program 69 pp 369– (1995) · Zbl 0839.90063 · doi:10.1007/BF01585566 |
| [43] | Thonemann, The effect of product variety on supply-chain performance, Eur J Oper Res 143 pp 548– (2002) · Zbl 1082.90501 · doi:10.1016/S0377-2217(01)00343-5 |
| [44] | van Ryzin, On the relationship between inventory costs and variety benefits in retail assortments, Management Sci 45 pp 1496– (1999) · Zbl 0953.90002 · doi:10.1287/mnsc.45.11.1496 |
| [45] | Yunes, Building efficient product portfolios at John Deere, Oper Res 55 pp 615– (2007) · Zbl 1167.90580 · doi:10.1287/opre.1070.0405 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
