Intrinsic core generalises the finite-dimensional notion of the relative interior to arbitrary (real) vector spaces. Our main goal is to provide a self-contained overview of the key results pertaining to the intrinsic core and to elucidate the relations between intrinsic core and facial structure of convex sets in this general context. We gather several equivalent definitions of the intrinsic core, cover much of the folklore, review relevant recent results and present examples illustrating some of the phenomena specific to the facial structure of infinite-dimensional sets.
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
我们研究了具有m个整数变量和k个非负连续变量的混合整数线性规划,其形式为Andersen,Louveaux,Weismantel和Wolsey引入的角多面体的松弛[Inequalities from two rows of a simplex tableau,Proc. IPCO 2007,LNCS,vol.4513,Springer,pp. 1- 15]。我们通过定义好的多面体的极值点来描述这个混合整数线性规划的方面。然后我们利用这个描述给出了多项式时间算法,以获得有效的不等式与最佳的l_p范数任意,但固定的m。对于m=2的情况,我们给出了Cornuejols和Margot [On the facets of mixed integer programs with two integer variables and two constraints,Math. Programming 120(2009),429- 456]的刻面特征的改进和新证明。我们的方法的关键点是,条件更加明确,可以以更直接的方式进行测试,消除了对约简算法的需要。这些结果使我们能够表明,放松角多面体只有多项式的许多方面。