A LINEAR MULTIPLE OBJECTIVE PROGRAMMING FOR ASSORTMENT AND PACKING PROBLEMS

Abstract

ABSTRACT This study proposed a multiple objective programming method to solve assortment and packing problems. Instead of using a two-stage method, as proposed by Li & Tsai [7], this study integrated the two stages into a multiple objective program to address assortment problems in one application. Moreover, this method could be extended to solve packing problems containing fewer 0-1 variables, thus, compared with Li et al. [8] the performance time of the proposed method could be decreased. The numerical examples showed that the proposed method is more efficient than Li & Tsai's [7], and Li et al.'s approaches [8].