Approximately global optimization for assortment problems using piecewise linearization techniques
Files
- 000176022300005.pdf (205.6 KB, Adobe PDF)
Date
2002-08-01
Type
Journal Title
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume, issue and pages
Vol. 140, No. 3, pp. 584–589
ISSN
0377-2217
Language
English
Abstract
Recently, Li and Chang proposed an approximate model for assortment problems. Although their model is quite promising to find approximately global solution, too many 0-1 variables are required in their solution process. This paper proposes another way for solving the same problem. The proposed method uses iteratively a technique of piecewise linearization of the quadratic objective function. Numerical examples demonstrate that the proposed method is computationally more efficient than the Li and Chang method. (C) 2002 Elsevier Science B.V. All rights reserved.
Collections
ArticlesCite this item
Li, H., Chang, C., & Tsai, J. (2002). Approximately global optimization for assortment problems using piecewise linearization techniques. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 140(3), 584–589. https://doi.org/10.1016/S0377-2217(01)00194-1
Citation generated in APA 7th edition style; please check it before use.
Share
Permanent link: https://ir.lib.nycu.edu.tw/handle/11536/28653