Results 11  20
of
21
Zonotopal Subdivisions of Cyclic Zonotopes
, 2001
"... The cyclic zonotope Z…n; d † is the zonotope in R d generated by any ndistinct vectors of the form …1; t; t2;...; td 1 †. It is proved that the refinement poset of all proper zonotopal subdivisions of Z…n; d † which are induced by the canonical projection p: Z…n; d0 †!Z…n; d†, in the sense of Biller ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The cyclic zonotope Z…n; d † is the zonotope in R d generated by any ndistinct vectors of the form …1; t; t2;...; td 1 †. It is proved that the refinement poset of all proper zonotopal subdivisions of Z…n; d † which are induced by the canonical projection p: Z…n; d0 †!Z…n; d†, in the sense of Billera and Sturmfels, is homotopy equivalent to a sphere and that any zonotopal subdivision of Z…n; d † is shellable. The first statement gives an affirmative answer to the generalized Baues problem in a new special case and refines a theorem of Sturmfels and Ziegler on the extension space of an alternating oriented matroid. An important ingredient in the proofs is the fact that all zonotopal subdivisions of Z…n; d † are stackable in a suitable direction. It is shown that, in general, a zonotopal subdivision is stackable in a given direction if and only if a certain associated oriented matroid program is Euclidean, in the sense of Edmonds and Mandel.
CrissCross Pivoting Rules
"... . Assuming that the reader is familiar with both the primal and dual simplex methods, Zionts' crisscross method can easily be explained. ffl It can be initialized by any, possibly both primal and dual infeasible basis . If the basis is optimal, we are done. If the basis is not optimal , th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. Assuming that the reader is familiar with both the primal and dual simplex methods, Zionts' crisscross method can easily be explained. ffl It can be initialized by any, possibly both primal and dual infeasible basis . If the basis is optimal, we are done. If the basis is not optimal , then there are some primal or dual infeasible variables. One might choose any of these. It is advised to choose once a primal and then a dual infeasible variable, if possible. ffl If the selected variable is dual infeasible, then it enters the basis and the leaving variable is chosen among the primal feasible variables in such a way that primal feasibility of the currently primal feasible variables is preserved. If no such basis exchange is possible another infeasible variable is selected. ffl If the selected variable is primal infeasible, then it leaves the basis and the entering variable is chosen among th
Combinatorial Maximum Improvement Algorithm for LP and LCP
, 1995
"... this paper, we show how one can design new pivot algorithms for solving the LP and the LCP. In particular, we are interested in combinatorial pivot algorithms which solve the LP and a certain class of LCP's. Here, a pivot algorithm is called combinatorial if the pivot choice depends only on the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this paper, we show how one can design new pivot algorithms for solving the LP and the LCP. In particular, we are interested in combinatorial pivot algorithms which solve the LP and a certain class of LCP's. Here, a pivot algorithm is called combinatorial if the pivot choice depends only on the signs of entries of their dictionaries. The best source of combinatorial pivot algorithms is in the theory of oriented matroid (OM) programming [Bla77a, Edm94, Fuk82, FT92, LL86, Ter87, Tod85, Wan87]. The wellknown Bland's pivot rule [Bla77b] for the simplex method can be considered as a combinatorial algorithm, but it is not a typical one. The main characteristic of the "OM" algorithms is that the feasibility may not be preserved at all in both primal and dual problem, and the finiteness of the algorithms is guaranteed by some purely combinatorial improvement argument rather than by the reasoning based on the increment of the objective function value. One immediate advantage of combinatorial algorithms is that the degeneracy does not have to be treated separately. Thus a very simple combinatorial algorithm, such as the crisscross method [Ter87, Wan87], solves the general LP correctly and yields one of the simplest proofs of the strong duality theorem. There is a wellnoted disadvantage of combinatorial algorithms. The number of pivot operations to solve the LP tends to grow rapidly in practice. Furthermore it is often quite easy to construct a class of LP's for which a given combinatorial algorithm takes an exponential number of pivot operations in the input size. In this paper, we review the finiteness proof of combinatorial algorithms and study a new algorithm in the class. The key ingredients of the new algorithm are "history dependency" and "largest combinatorial improveme...
Shellability of Oriented Matroids
, 1989
"... In [Man82] A. Mandel proved that the maximal cells of an Oriented Matroid poset are Bshellable. Our result shows that the whole Oriented Matroid is shellable, too. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In [Man82] A. Mandel proved that the maximal cells of an Oriented Matroid poset are Bshellable. Our result shows that the whole Oriented Matroid is shellable, too.
Euclideaness and final polynomials in oriented matroid theory
 COMBINATORICA
, 1993
"... This paper deals with a geometric construction of algebraic nonrealizability proofs for certain oriented matroids. As main result we obtain an algorithm which generates a (biquadratic) final polynomial [3], [5] for any noneuclidean oriented matroid. Here we apply the results of Edmonds, Fukuda a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This paper deals with a geometric construction of algebraic nonrealizability proofs for certain oriented matroids. As main result we obtain an algorithm which generates a (biquadratic) final polynomial [3], [5] for any noneuclidean oriented matroid. Here we apply the results of Edmonds, Fukuda and Mandel [6], [7] concerning nondegenerate cycling of linear programms in noneuclidean oriented matroids.
Edmonds Fukuda Rule And A General Recursion For Quadratic Programming
"... A general framework of nite algorithms is presented here for quadratic programming. This algorithm is a direct generalization of Van der Heyden's algorithm for the linear complementarity problem and Jensen's `relaxed recursive algorithm', which was proposed for solution of Oriented Ma ..."
Abstract
 Add to MetaCart
A general framework of nite algorithms is presented here for quadratic programming. This algorithm is a direct generalization of Van der Heyden's algorithm for the linear complementarity problem and Jensen's `relaxed recursive algorithm', which was proposed for solution of Oriented Matroid programming problems. The validity of this algorithm is proved the same way as the finiteness of the crisscross method is proved. The second part of this paper contains a generalization of EdmondsFukuda pivoting rule for quadratic programming. This generalization can be considered as a finite version of Van de Panne  Whinston algorithm and so it is a simplex method for quadratic programming. These algorithms uses general combinatorial type ideas, so the same methods can be applied for oriented matroids as well. The generalization of these methods for oriented matroids is a subject of another paper.
Extension Spaces of Oriented Matriods
, 1991
"... We study the space of all extensions of a real hyperplane arrangement by a new pseudohyperplane, and, more generally, of an oriented matroid by a new element. The question whether this space has the homotopy type of a sphere is a special case of the "Generalized Baues Problem" of Biller ..."
Abstract
 Add to MetaCart
We study the space of all extensions of a real hyperplane arrangement by a new pseudohyperplane, and, more generally, of an oriented matroid by a new element. The question whether this space has the homotopy type of a sphere is a special case of the "Generalized Baues Problem" of Billera, Kapranov & Sturmfels, via the BohneDress Theorem on zonotopal tilings. We prove that the extension space is spherical for the class of strongly euclidean oriented matroids. This class includes the alternating matroids and all oriented matroids of rank at most 3 or of corank at most 2. In general it is not even known whether the extension space is connected. We show that the subspace of realizable extensions is always connected but not necessarily spherical.