New product introduction against a predator: A bilevel mixed-integer programming approach
From MaRDI portal
Publication:3655566
DOI10.1002/nav.20375zbMath1177.90236OpenAlexW2070723410WikidataQ115612322 ScholiaQ115612322MaRDI QIDQ3655566
Churlzu Lim, Aydn Alptekinolu, J. Cole Smith
Publication date: 8 January 2010
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20375
Mixed integer programming (90C11) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Marketing, advertising (90B60)
Related Items
Optimizing assortment and pricing of multiple retail categories with cross-selling ⋮ In-out algorithm for assortment planning under a ranking-based consumer choice model ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ A mixed-integer bilevel programming approach for a competitive prioritized set covering problem ⋮ Assortment planning with nested preferences: dynamic programming with distributions as states? ⋮ A survey of network interdiction models and algorithms ⋮ Technical Note—An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model
Cites Work
- Unnamed Item
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Telecommunication link restoration planning with multiple facility types
- Competitive location, production, and market selection
- The effect of product variety on supply-chain performance
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Survivable network design under optimal and heuristic interdiction scenarios
- Min-Max payoffs in a two-player location game
- Note: How Does Product Proliferation Affect Responsiveness?
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Assortment Planning and Inventory Decisions Under a Locational Choice Model
- A New Algebraic Geometry Algorithm for Integer Programming
- Building Efficient Product Portfolios at John Deere and Company
- Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees
- Inventory Competition Under Dynamic Consumer Choice
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A cutting plane algorithm for solving bilinear programs
- Modelling the Costs and Benefits of Delayed Product Differentiation
- On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
- A Continuous Model for Multistore Competitive Location
- Joint pricing, assortment, and inventory decisions for a retailer's product line
- Concavity cuts for disjoint bilinear programming
