Share-of-surplus product line optimisation with price levels
From MaRDI portal
Publication:1718255
DOI10.1155/2014/389749zbMath1407.90138OpenAlexW2021671860WikidataQ59064924 ScholiaQ59064924MaRDI QIDQ1718255
C. K. Kwong, Xinggang Luo, Zichen Zhang, Jiafu Tang
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/389749
Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Cites Work
- Product line selection and pricing under a share-of-surplus choice model.
- Integrating supplier selection in optimal product family design
- Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem
- Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
- Optimizing Product Line Designs: Efficient Methods and Comparisons
- Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics
This page was built for publication: Share-of-surplus product line optimisation with price levels