Approximately global optimization for assortment problems using piecewise linearization techniques

Han-Lin Li*, Ching Ter Chang, Jung Fa Tsai

*此作品的通信作者

研究成果: Article同行評審

42 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)584-589
頁數6
期刊European Journal of Operational Research
140
發行號3
DOIs
出版狀態Published - 1 8月 2002

指紋

深入研究「Approximately global optimization for assortment problems using piecewise linearization techniques」主題。共同形成了獨特的指紋。

引用此