Approximately global optimization for assortment problems using piecewise linearization techniques

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 metho...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2002-08, Vol.140 (3), p.584-589
Main Authors: Li, Han-Lin, Chang, Ching-Ter, Tsai, Jung-Fa
Format: Article
Language:English
Subjects:
Assortment
Cutting
Global optimization
Linear programming
Optimization
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(01)00194-1