Approximately global optimization for assortment problems using piecewise linearization techniques

doi:10.1016/S0377-2217(01)00194-1

Approximately global optimization for assortment problems using piecewise linearization techniques

2002-08-01

37

PRE

AI

DOI：10.1016/S0377-2217(01)00194-1

原文链接

原文求助

摘要

En 中文

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.

Keyword:

cutting

assortment

global optimization

Approximately global optimization for assortment problems using piecewise linearization techniques

摘要

AI总结

期刊

机构

引用论文