Article ID: | iaor20021749 |
Country: | United Kingdom |
Volume: | 28 |
Issue: | 12 |
Start Page Number: | 1245 |
End Page Number: | 1252 |
Publication Date: | Oct 2001 |
Journal: | Computers and Operations Research |
Authors: | Li Han-Lin, Tsai Jung-Fa |
Keywords: | programming: integer |
Assortment optimization problems intend to seek the best way of placing a given set of rectangles within a minimum-area rectangle. Such problems are often formulated as a quadratic mixed 0–1 program. Many current methods for assortment problems are either unable to find an optimal solution or being computationally inefficient for reaching an optimal solution. This paper proposes a new method which finds the optimum of assortment problem by solving few linear mixed 0–1 programs. Numerical examples show that the proposed method is more computationally efficient than current methods.