509 research outputs found
The structure of the infinite models in integer programming
The infinite models in integer programming can be described as the convex
hull of some points or as the intersection of halfspaces derived from valid
functions. In this paper we study the relationships between these two
descriptions. Our results have implications for corner polyhedra. One
consequence is that nonnegative, continuous valid functions suffice to describe
corner polyhedra (with or without rational data)
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
We examine the connections between the classes of cuts in the title. We show that lift-and-project (L&P) cuts from a given disjunction are equivalent to generalized intersection cuts from the family of polyhedra obtained by taking positive combinations of the complements of the inequalities of each term of the disjunction. While L&P cuts from split disjunctions are known to be equivalent to standard intersection cuts (SICs) from the strip obtained by complementing the terms of the split, we show that L&P cuts from more general disjunctions may not be equivalent to any SIC. In particular, we give easily verifiable necessary and sufficient conditions for a L&P cut from a given disjunction D to be equivalent to a SIC from the polyhedral counterpart of D. Irregular L&P cuts, i.e. those that violate these conditions, have interesting properties. For instance, unlike the regular ones, they may cut off part of the corner polyhedron associated with the LP solution from which they are derived. Furthermore, they are not exceptional: their frequency exceeds that of regular cuts. A numerical example illustrates some of the above properties. © 2016 Springer-Verlag Berlin Heidelberg and Mathematical Optimization Societ
Minimal average degree aberration and the state polytope for experimental designs
For a particular experimental design, there is interest in finding which
polynomial models can be identified in the usual regression set up. The
algebraic methods based on Groebner bases provide a systematic way of doing
this. The algebraic method does not in general produce all estimable models but
it can be shown that it yields models which have minimal average degree in a
well-defined sense and in both a weighted and unweighted version. This provides
an alternative measure to that based on "aberration" and moreover is applicable
to any experimental design. A simple algorithm is given and bounds are derived
for the criteria, which may be used to give asymptotic Nyquist-like
estimability rates as model and sample sizes increase
When Lift-and-Project Cuts are Different
In this paper, we present a method to determine if a lift-and-project cut for
a mixed-integer linear program is irregular, in which case the cut is not
equivalent to any intersection cut from the bases of the linear relaxation.
This is an important question due to the intense research activity for the past
decade on cuts from multiple rows of simplex tableau as well as on
lift-and-project cuts from non-split disjunctions. While it is known since
Balas and Perregaard (2003) that lift-and-project cuts from split disjunctions
are always equivalent to intersection cuts and consequently to such multi-row
cuts, Balas and Kis (2016) have recently shown that there is a necessary and
sufficient condition in the case of arbitrary disjunctions: a lift-and-project
cut is regular if, and only if, it corresponds to a regular basic solution of
the Cut Generating Linear Program (CGLP). This paper has four contributions.
First, we state a result that simplifies the verification of regularity for
basic CGLP solutions from Balas and Kis (2016). Second, we provide a
mixed-integer formulation that checks whether there is a regular CGLP solution
for a given cut that is regular in a broader sense, which also encompasses
irregular cuts that are implied by the regular cut closure. Third, we describe
a numerical procedure based on such formulation that identifies irregular
lift-and-project cuts. Finally, we use this method to evaluate how often
lift-and-project cuts from simple -branch split disjunctions are irregular,
and thus not equivalent to multi-row cuts, on 74 instances of the MIPLIB
benchmarks.Comment: INFORMS Journal on Computing (to appear
Geometric entropy, area, and strong subadditivity
The trace over the degrees of freedom located in a subset of the space
transforms the vacuum state into a density matrix with non zero entropy. This
geometric entropy is believed to be deeply related to the entropy of black
holes. Indeed, previous calculations in the context of quantum field theory,
where the result is actually ultraviolet divergent, have shown that the
geometric entropy is proportional to the area for a very special type of
subsets. In this work we show that the area law follows in general from simple
considerations based on quantum mechanics and relativity. An essential
ingredient of our approach is the strong subadditive property of the quantum
mechanical entropy.Comment: Published versio
Steinitz Theorems for Orthogonal Polyhedra
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron
with the topology of a sphere in which three mutually-perpendicular edges meet
at each vertex. By analogy to Steinitz's theorem characterizing the graphs of
convex polyhedra, we find graph-theoretic characterizations of three classes of
simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric
projection in the plane with only one hidden vertex, xyz polyhedra, in which
each axis-parallel line through a vertex contains exactly one other vertex, and
arbitrary simple orthogonal polyhedra. In particular, the graphs of xyz
polyhedra are exactly the bipartite cubic polyhedral graphs, and every
bipartite cubic polyhedral graph with a 4-connected dual graph is the graph of
a corner polyhedron. Based on our characterizations we find efficient
algorithms for constructing orthogonal polyhedra from their graphs.Comment: 48 pages, 31 figure
Relaxations of mixed integer sets from lattice-free polyhedra
This paper gives an introduction to a recently established link between the geometry of numbers and mixed integer optimization. The main focus is to provide a review of families of lattice-free polyhedra and their use in a disjunctive programming approach. The use of lattice-free polyhedra in the context of deriving and explaining cutting planes for mixed integer programs is not only mathematically interesting, but it leads to some fundamental new discoveries, such as an understanding under which conditions cutting planes algorithms converge finitel
Tropical Severi Varieties
We study the tropicalizations of Severi varieties, which we call tropical
Severi varieties. In this paper, we give a partial answer to the following
question, ``describe the tropical Severi varieties explicitly.'' We obtain a
description of tropical Severi varieties in terms of regular subdivisions of
polygons. As an intermediate step, we construct explicit parameter spaces of
curves. These parameter spaces are much simpler objects than the corresponding
Severi variety and they are closely related to flat degenerations of the Severi
variety, which in turn describes the tropical Severi variety. As an
application, we understand G.Mikhalkin's correspondence theorem for the degrees
of Severi varieties in terms of tropical intersection theory. In particular,
this provides a proof of the independence of point-configurations in the
enumeration of tropical nodal curves.Comment: 25 pages, Final version accepted to Portugal. Mat
- …