Valid inequalities for the multi-dimensional multiple-choice 0–1 knapsack problem

摘要: This paper presents a study of the polytope defined by minimizing form binary knapsack inequality, which is greater-than-or-equal-to constraint, augmented disjoint generalized upper bound constraints. A set valid inequalities, called α -cover characterized and dominance relationships among them are established. Both sequential sequence-independent lifting procedures presented to tighten an inequality that not facet defining. Computational results aimed at evaluating strength non-dominated, sequentially, lifted inequalities provided. Derives for multiple-choice 0-1 problem.Derives establishes -covers inequalities.Presents procedures.Computational tests assess resulting inequalities.Tests in application multi-dimensional, problem.