Abstract
ABSTRACTProduct Line Design (PLD) is one of the most critical decisions to be made by a firm for it to be successful in a competitive business environment. Existing conjoint models for PLD optimization either have not accounted for the retaliatory reactions by incumbent firms to the introduction of new products or have focused on the Nash game to model such competitive interactions, in which all firms are treated equally. However, one firm may own more information on the rivals' behavior, more resources to pre-commit, or a first-mover advantage. This article formulates a Stackelberg–Nash game-theoretic model for the Competitive Product Line Design (CPLD) problem, in which a new entrant wants to enter a competitive market by offering new products where there are existing products belonging to several incumbent firms. A bilevel 0–1 integer nonlinear programming model is developed based on the Stackelberg–Nash game where the new entrant is a leader and the incumbent firms are followers. Consistent with the bilevel optimization model, a nested bilevel genetic algorithm with sequential tatonnement is implemented to find the corresponding Stackelberg–Nash equilibrium for CPLD. An industrial case of mobile phone product is also presented to illustrate the feasibility and potential of the proposed leader–followers model and algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.