Search results for "Polytope"
showing 10 items of 25 documents
Packing a Trunk
2003
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car trunk, the aim is to pack as many identical boxes of size 4 × 2 × 1 units as possible into the interior of the trunk. This measure is important for car manufacturers, because it is a standard in the European Union.
Matroid optimization problems with monotone monomials in the objective
2022
Abstract In this paper we investigate non-linear matroid optimization problems with polynomial objective functions where the monomials satisfy certain monotonicity properties. Indeed, we study problems where the set of non-linear monomials consists of all non-linear monomials that can be built from a given subset of the variables. Linearizing all non-linear monomials we study the respective polytope. We present a complete description of this polytope. Apart from linearization constraints one needs appropriately strengthened rank inequalities. The separation problem for these inequalities reduces to a submodular function minimization problem. These polyhedral results give rise to a new hiera…
Real quadrics in C n , complex manifolds and convex polytopes
2006
In this paper, we investigate the topology of a class of non-Kähler compact complex manifolds generalizing that of Hopf and Calabi-Eckmann manifolds. These manifolds are diffeomorphic to special systems of real quadrics Cn which are invariant with respect to the natural action of the real torus (S1)n onto Cn. The quotient space is a simple convex polytope. The problem reduces thus to the study of the topology of certain real algebraic sets and can be handled using combinatorial results on convex polytopes. We prove that the homology groups of these compact complex manifolds can have arbitrary amount of torsion so that their topology is extremely rich. We also resolve an associated wall-cros…
Convex bodies and convexity on Grassmann cones
1962
Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler
1982
This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.
On base loci of higher fundamental forms of toric varieties
2019
We study the base locus of the higher fundamental forms of a projective toric variety $X$ at a general point. More precisely we consider the closure $X$ of the image of a map $({\mathbb C}^*)^k\to {\mathbb P}^n$, sending $t$ to the vector of Laurent monomials with exponents $p_0,\dots,p_n\in {\mathbb Z}^k$. We prove that the $m$-th fundamental form of such an $X$ at a general point has non empty base locus if and only if the points $p_i$ lie on a suitable degree-$m$ affine hypersurface. We then restrict to the case in which the points $p_i$ are all the lattice points of a lattice polytope and we give some applications of the above result. In particular we provide a classification for the se…
A simplified predictive control of constrained Markov jump system with mixed uncertainties
2014
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2014/475808 Open Access A simplified model predictive control algorithm is designed for discrete-time Markov jump systems with mixed uncertainties. The mixed uncertainties include model polytope uncertainty and partly unknown transition probability. The simplified algorithm involves finite steps. Firstly, in the previous steps, a simplified mode-dependent predictive controller is presented to drive the state to the neighbor area around the origin. Then the trajectory of states is driven as expected to the origin by the final-step mode-independent pre…
On the number of singularities, zero curvature points and vertices of a simple convex space curve
1995
We prove a generalization of the 4 vertex theorem forC3 closed simple convex space curves including singular and zero curvature points.
Predictive control of convex polyhedron LPV systems with Markov jumping parameters
2012
The problem of receding horizon predictive control of stochastic linear parameter varying systems is discussed. First, constant coefficient matrices are obtained at each vertex in the interior of linear parameter varying system, and then, by considering semi-definite programming constraints, weight coefficients between each vertex are calculated, and the equal coefficients matrices for the time variable system are obtained. Second, in the given receding horizon, for each mode sequence of the stochastic convex polyhedron linear parameter varying systems, the optimal control input sequences are designed in order to make the states into a terminal invariant set. Outside of the receding horizon…
Solution isolation strategies for the Bernstein polytopes-based solver
2013
The Bernstein polytopes-based solver is a new method developed to solve systems of nonlinear equations, which often occur in Geometric Constraint Solving Problems. The principle of this solver is to linearize nonlinear monomials and then to solve the resulting linear programming problems, through linear programming. However, without any strategy for the isolation of the many solutions of multiple-solution systems, this solver is slow in practice. To overcome this problem, we propose in this work, a study of several strategies for solution isolation, through the split of solution boxes into several subboxes, according to three main steps answering the questions: when, where, and how to perfo…