Extended formulations for order polytopes through network flows

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Formulations for Polytopes of Regular Matroids

We present a simple proof of the fact that the base (and independence) polytope of a rank n regular matroid over m elements has an extension complexity O(mn).

متن کامل

Extended Formulations for Independence Polytopes of Regular Matroids

Abstract. We show that the independence polytope of every regular matroid has an extended formulation of size quadratic in the size of its ground set. This generalizes a similar statement for (co-)graphic matroids, which is a simple consequence of Martin’s [9] extended formulation for the spanning-tree polytope. In our construction, we make use of Seymour’s decomposition theorem for regular mat...

متن کامل

Some 0/1 polytopes need exponential size extended formulations

We prove that there are 0/1 polytopes P ⊆ R that do not admit a compact LP formulation. More precisely we show that for every n there is a sets X ⊆ {0, 1}n such that conv(X) must have extension complexity at least 2. In other words, every polyhedron Q that can be linearly projected on conv(X) must have exponentially many facets. In fact, the same result also applies if conv(X) is restricted to ...

متن کامل

Extended formulations for polygons

The extension complexity of a polytope P is the smallest integer k such that P is the projection of a polytope Q with k facets. We study the extension complexity of n-gons in the plane. First, we give a new proof that the extension complexity of regular n-gons is O(logn), a result originating from work by Ben-Tal and Nemirovski (Math. Oper. Res. 26(2), 193–205, 2001). Our proof easily generaliz...

متن کامل

Gorenstein Fano Polytopes Arising from Order Polytopes and Chain Polytopes

Richard Stanley introduced the order polytope O(P ) and the chain polytope C(P ) arising from a finite partially ordered set P , and showed that the Ehrhart polynomial of O(P ) is equal to that of C(P ). In addition, the unimodular equivalence problem of O(P ) and C(P ) was studied by the first author and Nan Li. In the present paper, three integral convex polytopes Γ(O(P ),−O(Q)), Γ(O(P ),−C(Q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Psychology

سال: 2018

ISSN: 0022-2496

DOI: 10.1016/j.jmp.2018.08.003