.png){kind=icon}
.png){kind=icon}
Return
An optimization method to estimate models with store-level data: A case study
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.08.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The quality of the estimation of a latent segment model when only store-level aggregate data is available seems to be dependent on the computational methods selected and in particular on the optimization methodology used to obtain it. Following the stream of work that emphasizes the estimation of a segmentation structure with aggregate data, this work proposes an optimization method, among the deterministic optimization methods, that can provide estimates for segment characteristics as well as size, brand/product preferences and sensitivity to price and price promotion variation estimates that can be accommodated in dynamic models. It is shown that, among the gradient based optimization methods that were tested, the Sequential Quadratic Programming method (SQP) is the only that, for all scenarios tested for this type of problem, guarantees of reliability, precision and efficiency being robust, i.e., always able to deliver a solution. Therefore, the latent segment models can be estimated using the SQP method when only aggregate market data is available. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Marketing
Quadratic programming
Latent models
Segmentation
Market segmentation
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W