A MIXED-INTEGER PROGRAMMING-MODEL FOR A CLASS OF ASSORTMENT PROBLEMS

Chin‐Sheng Chen

doi:10.1016/0377-2217(93)90116-5

1993-03-01

PRE

Chin‐Sheng Chen *

Sanjiv Sarin

Balasubramanian Ram

DOI：10.1016/0377-2217(93)90116-5

原文链接

原文求助

摘要

En 中文

We consider the problem of placing a set of rectangles of different sizes, in a non-overlapping fashion, within a large rectangle of minimum area. This general problem has several practical applications in location of departments in a minimum area and in two dimensional stock-cutting with the objective of keeping trim-loss at a minimum. We formulate the problem as a mixed-integer non-linear programming problem. We present computational results for two special cases of the general problem that reduce to linear integer programs.

Keyword:

DISTRIBUTION

MANUFACTURING

INTEGER

OPTIMIZATION