The continuous knapsack set

We study the convex hull of the continuous knapsack set which consists of a single inequality constraint with n non-negative integer and m non-negative bounded continuous variables. When n = 1, this set is a slight generalization of the single arc flow set studied by Magnanti, Mirchandani, and Vachani (1993). We first show that in any facet-defining inequality, the number of distinct non-zero coefficients of the continuous variables is bounded by 2n − n. Our next result is to show that when n = 2, this upper

• Type: Journal
• Year: 2016
• Where: MP
• Authors: Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey
• Keywords: Information Technology, MP 2016