Approximately global optimization for assortment problems using piecewise linearization techniques

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

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.

Original languageEnglish
Pages (from-to)584-589
Number of pages6
JournalEuropean Journal of Operational Research
Volume140
Issue number3
DOIs
StatePublished - 1 Aug 2002

Keywords

  • Assortment
  • Cutting
  • Global optimization

Fingerprint Dive into the research topics of 'Approximately global optimization for assortment problems using piecewise linearization techniques'. Together they form a unique fingerprint.

Cite this