Approximately global optimization for assortment problems using piecewise linearization techniques
檔案
- 000176022300005.pdf (205.6 KB, Adobe PDF)
日期
2002-08-01
類型
期刊名稱
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷期與頁次
第 140 卷第 3 期,頁 584–589
ISSN
0377-2217
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28653