Results 1  10
of
20
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
, 1992
"... We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following prope ..."
Abstract

Cited by 182 (28 self)
 Add to MetaCart
We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following properties: (a) Virtually no additional storage is required beyond the input data; (b) The output list produced is free of duplicates; (c) The algorithm is extremely simple, requires no data structures, and handles all degenerate cases; (d) The running time is output sensitive for nondegenerate inputs; (e) The algorithm is easy to efficiently parallelize. For example, the algorithm finds the v vertices of a polyhedron in R d defined by a nondegenerate system of n inequalities (or dually, the v facets of the convex hull of n points in R d,where each facet contains exactly d given points) in time O(ndv) and O(nd) space. The v vertices in a simple arrangement of n hyperplanes in R d can be found in O(n 2 dv) time and O(nd) space complexity. The algorithm is based on inverting finite pivot algorithms for linear programming.
Triangulations Of Oriented Matroids
, 1997
"... We consider the concept of triangulation of an oriented matroid. We provide a definition which generalizes the previous ones by Billera Munson and by Anderson and which specializes to the usual notion of triangulation (or simplicial fan) in the realizable case. Then we study the relation existing ..."
Abstract

Cited by 25 (12 self)
 Add to MetaCart
We consider the concept of triangulation of an oriented matroid. We provide a definition which generalizes the previous ones by Billera Munson and by Anderson and which specializes to the usual notion of triangulation (or simplicial fan) in the realizable case. Then we study the relation existing between triangulations of an oriented matroid M and extensions of its dual M , via the socalled lifting triangulations. We show that this duality behaves particularly well in the class of Lawrence matroid polytopes. In particular, that the extension space conjecture for realizable oriented matroids posed by Sturmfels and Ziegler is equivalent to the restriction to Lawrence polytopes of the Generalized Baues problem for subdivisions of polytopes. We finish showing examples and a combinatorial characterization of lifting triangulations. Introduction Matroids (see [23]) and oriented matroids (see [8]) are axiomatic abstract models for combinatorial geometry over general fields and ordere...
CrissCross Methods: A Fresh View on Pivot Algorithms
 Mathematical Programming
, 1997
"... this paper is to present mathematical ideas and ..."
Linear Complementarity and Oriented Matroids
 Journal of the Operational Research Society of Japan
, 1990
"... A combinatorial abstraction of the linear complementarity theory in the setting of oriented matroids was rst considered by M.J. Todd. In this paper, we take a fresh look at this abstraction, and attempt to give a simple treatment of the combinatorial theory of linear complementarity. We obtain new t ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
A combinatorial abstraction of the linear complementarity theory in the setting of oriented matroids was rst considered by M.J. Todd. In this paper, we take a fresh look at this abstraction, and attempt to give a simple treatment of the combinatorial theory of linear complementarity. We obtain new theorems, proofs and algorithms in oriented matroids whose specializations to the linear case are also new. For this, the notion of suciency of square matrices, introduced by Cottle, Pang and Venkateswaran, is extended to oriented matroids. Then, we prove a sort of duality theorem for oriented matroids, which roughly states: exactly one of the primal and the dual system has a complementary solution if the associated oriented matroid satisfies "weak" sufficiency. We give two different proofs for this theorem, an elementary inductive proof and an algorithmic proof using the crisscross method which solves one of the primal or dual problem by using surprisingly simple pivot rules (without any pertur...
Generation of oriented matroids – A graph theoretical approach
 Discrete Comput Geom
, 2002
"... We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriente ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discuss the single element extensions in terms of localizations which can be viewed as partitions of the vertex sets of the graphs. Whereas localizations of the cocircuit graph are well characterized, there is no graph theoretical characterization known for localizations of the tope graph. In this paper we prove a connectedness property for tope graph localizations and use this for the design of algorithms for the generation of single element extensions by use of tope graphs. Furthermore we discuss similar algorithms which use the cocircuit graph. The characterization of localizations of cocircuit graphs nally leads to a backtracking algorithm which is a simple and efficient method for the generation of single element extensions. We compare this method with a recent algorithm of Bokowski and Guedes de Oliveira for uniform oriented matroids.
A Survey on Pivot Rules for Linear Programming
 ANNALS OF OPERATIONS RESEARCH. (SUBMITTED
, 1991
"... The purpose of this paper is to survey the various pivot rules of the simplex method or its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with the finiteness property of simplex type pivot rules. Th ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The purpose of this paper is to survey the various pivot rules of the simplex method or its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with the finiteness property of simplex type pivot rules. There are some other important topics in linear programming, e.g. complexity theory or implementations, that are not included in the scope of this paper. We do not discuss ellipsoid methods nor interior point methods. Well known classical results concerning the simplex method are also not particularly discussed in this survey, but the connection between the new methods and the classical ones are discussed if there is any. In this paper we discuss three classes of recently developed pivot rules for linear programming. The first class (the largest one) of the pivot rules we discuss is the class of essentially combinatorial pivot rules. Namely these rules only use labeling and signs of the variab...
A Monotonic BuildUp Simplex Algorithm for Linear Programming
, 1991
"... We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost, the pivot rule produces a sequence of pivots such that ultimately the originally chosen nonbasic variable enters the ba ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost, the pivot rule produces a sequence of pivots such that ultimately the originally chosen nonbasic variable enters the basis, and all reduced costs which were originally nonnegative remain nonnegative. The pivot rule thus monotonically builds up to a dual feasible, and hence optimal, basis. A surprising property of the pivot rule is that the pivot sequence results in intermediate bases which are neither primal nor dual feasible. We prove correctness of the procedure, give a geometric interpretation, and relate it to other pivoting rules for linear programming.
New Variants Of Finite CrissCross Pivot Algorithms For Linear Programming
, 1997
"... In this paper we generalize the socalled firstinlastout pivot rule and the mostoftenselectedvariable pivot rule for the simplex method, as proposed in Zhang [13], to the crisscross pivot setting where neither the primal nor the dual feasibility is preserved. The finiteness of the new crisscr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we generalize the socalled firstinlastout pivot rule and the mostoftenselectedvariable pivot rule for the simplex method, as proposed in Zhang [13], to the crisscross pivot setting where neither the primal nor the dual feasibility is preserved. The finiteness of the new crisscross pivot variants is proven.
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.
The HoltKlee condition for oriented matroids
 European J. Combinatorics
, 2009
"... Holt and Klee have recently shown that every (generic) LP orientation of the graph of a dpolytope satisfies a directed version of the dconnectivity property, i.e. there are d internally disjoint directed paths from a unique source to a unique sink. We introduce two new classes HK and HK * of orien ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Holt and Klee have recently shown that every (generic) LP orientation of the graph of a dpolytope satisfies a directed version of the dconnectivity property, i.e. there are d internally disjoint directed paths from a unique source to a unique sink. We introduce two new classes HK and HK * of oriented matroids (OMs) by enforcing this property and its dual interpretation in terms of line shellings, respectively. Both classes contain all representable OMs by the HoltKlee theorem. While we give a construction of an infinite family of nonHK * OMs, it is not clear whether there exists any nonHK OM. This leads to a fundamental question as to whether the HoltKlee theorem can be proven combinatorially by using the OM axioms only. Finally, we give the complete classification of OM(4, 8), the OMs of rank 4 on 8element ground set with respect to the HK, HK*, Euclidean and Shannon properties. Our classification shows that there exists no nonHK OM in this class. 1