arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.1077math.OC
收藏

关于带背包约束的混合集

On the mixing set with a knapsack constraint

Ahmad Abdi, Ricardo Fukasawa

摘要:

带有背包约束的混合集作为有限离散分布上随机右端的机会约束规划的混合整数规划重构的子结构而出现。最近,Luedtke et al.(2010)和Küçükyavuz(2012)研究了这类集合的有效不等式。然而,他们的大多数结果都集中在等概率的情况下(相当于当背包减少到基数约束时),在一般情况下只有很少的结果。在本文中,我们专注于一般概率的情况下(一般背包约束)。我们的有效的不平等,不来自背包多面体的特征,并使用此特征推广的不等式先前得出的等概率的情况下。我们还表明,一个可以分离的一大类不等式在多项式时间。

英文摘要:

The mixing set with a knapsack constraint arises as a substructure in mixed-integer programming reformulations of chance-constrained programs with stochastic right-hand-sides over a finite discrete distribution. Recently, Luedtke et al. (2010) and Küçükyavuz (2012) studied valid inequalities for such sets. However, most of their results were focused on the equal probabilities case (equivalently when the knapsack reduces to a cardinality constraint), with only minor results in the general case. In this paper, we focus on the general probabilities case (general knapsack constraint). We characterize the valid inequalities that do not come from the knapsack polytope and use this characterization to generalize the inequalities previously derived for the equal probabilities case. We also show that one can separate over a large class of inequalities in polynomial time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑