- Source: Oriented matroid
An oriented matroid is a mathematical structure that abstracts the properties of directed graphs, vector arrangements over ordered fields, and hyperplane arrangements over ordered fields. In comparison, an ordinary (i.e., non-oriented) matroid abstracts the dependence properties that are common both to graphs, which are not necessarily directed, and to arrangements of vectors over fields, which are not necessarily ordered.
All oriented matroids have an underlying matroid. Thus, results on ordinary matroids can be applied to oriented matroids. However, the converse is false; some matroids cannot become an oriented matroid by orienting an underlying structure (e.g., circuits or independent sets).
The distinction between matroids and oriented matroids is discussed further below.
Matroids are often useful in areas such as dimension theory and algorithms.
Because of an oriented matroid's inclusion of additional details about the oriented nature of a structure,
its usefulness extends further into several areas including geometry and optimization.
History
The first appearance of oriented matroids was in a 1966 article by George J. Minty and was confined to regular matroids.
Subsequently R.T. Rockefellar (1969) suggested the problem of generalizing Minty's concept to real vector spaces. His proposal helped lead to the development of the general theory.
Background
In order to abstract the concept of orientation on the edges of a graph to sets, one needs the ability to assign "direction" to the elements of a set. The way this achieved is with the following definition of signed sets.
A signed set,
X
{\displaystyle X}
, combines a set of objects,
X
_
{\displaystyle {\underline {X}}}
, with an ordered bipartition
(
X
+
,
X
−
)
{\displaystyle (X^{+},X^{-})}
of that set into two disjoint subsets:
X
+
{\displaystyle X^{+}}
and
X
−
{\displaystyle X^{-}}
.
The members of
X
+
{\displaystyle X^{+}}
are called the positive elements; members of
X
−
{\displaystyle X^{-}}
are the negative elements.
The set
X
_
=
X
+
∪
X
−
{\displaystyle {\underline {X}}=X^{+}\cup X^{-}}
is called the support of
X
{\displaystyle X}
.
The empty signed set,
∅
{\displaystyle \emptyset }
, is defined as the empty set
∅
_
{\displaystyle {\underline {\emptyset }}}
combined with an (ordered) bipartition of it into two empty sets:
∅
+
{\displaystyle \emptyset ^{+}}
and
∅
−
{\displaystyle \emptyset ^{-}}
.
The signed set
Y
{\displaystyle Y}
is the opposite of
X
{\displaystyle X}
, written
Y
=
−
X
{\displaystyle Y=-X}
, if
Y
+
=
X
−
{\displaystyle Y^{+}=X^{-}}
and
Y
−
=
X
+
.
{\displaystyle Y^{-}=X^{+}.}
Given an element
x
{\displaystyle x}
of the support, we will write
x
{\displaystyle x}
for a positive element and
−
x
{\displaystyle -x}
for a negative element. In this way, a signed set is just adding negative signs to distinguished elements. This will make sense as a "direction" only when we consider orientations of larger structures. Then the sign of each element will encode its direction relative to this orientation.
Axiomatizations
Like ordinary matroids, several equivalent systems of axioms exist. (Such structures that possess multiple equivalent axiomatizations are called cryptomorphic.)
= Circuit axioms
=Let
E
{\displaystyle E}
be any set. We refer to
E
{\displaystyle E}
as the ground set. Let
C
{\displaystyle {\mathcal {C}}}
be a collection of signed sets, each of which is supported by a subset of
E
{\displaystyle E}
.
If the following axioms hold for
C
{\displaystyle {\mathcal {C}}}
, then equivalently
C
{\displaystyle {\mathcal {C}}}
is the set of signed circuits
for an oriented matroid on
E
{\displaystyle E}
.
(C0)
∅
∉
C
{\displaystyle \emptyset \notin {\mathcal {C}}}
(C1) (symmetric)
For all
X
∈
C
,
−
X
∈
C
.
{\displaystyle {\text{ For all }}X\in {\mathcal {C}},~-\!X\in {\mathcal {C}}.}
(C2) (incomparable)
For all
X
,
Y
∈
C
,
if
X
_
⊆
Y
_
then
(
X
=
Y
or
X
=
−
Y
)
.
{\displaystyle {\text{ For all }}X,Y\in {\mathcal {C}},~~{\text{ if }}{\underline {X}}\subseteq {\underline {Y}}{\text{ then }}(X=Y{\text{ or }}X=-Y).}
(C3) (weak elimination)
For all
X
,
Y
∈
C
,
X
≠
−
Y
with an
e
∈
X
+
∩
Y
−
there is a
Z
∈
C
such that
{\displaystyle {\text{ For all }}X,Y\in {\mathcal {C}},X\neq -Y{\text{ with an }}e\in X^{+}\cap Y^{-}{\text{ there is a }}Z\in {\mathcal {C}}{\text{ such that }}}
Z
+
⊆
(
X
+
∪
Y
+
)
∖
{
e
}
and
{\displaystyle Z^{+}\subseteq (X^{+}\cup Y^{+})\setminus \{e\}{\text{ and }}}
Z
−
⊆
(
X
−
∪
Y
−
)
∖
{
e
}
.
{\displaystyle Z^{-}\subseteq (X^{-}\cup Y^{-})\setminus \{e\}.}
= Vector Axioms
=The composition of signed sets
X
{\displaystyle X}
and
Y
{\displaystyle Y}
is the signed set
X
∘
Y
{\displaystyle X\circ Y}
defined by
X
∘
Y
_
=
X
_
∪
Y
_
{\displaystyle {\underline {X\circ Y}}={\underline {X}}\cup {\underline {Y}}}
,
(
X
∘
Y
)
+
=
X
+
∪
(
Y
+
∖
X
−
)
{\displaystyle (X\circ Y)^{+}=X^{+}\cup \left(Y^{+}\setminus X^{-}\right)}
, and
(
X
∘
Y
)
−
=
X
−
∪
(
Y
−
∖
X
+
)
{\displaystyle (X\circ Y)^{-}=X^{-}\cup \left(Y^{-}\setminus X^{+}\right)}
. The vectors of an oriented matroid are the compositions of circuits. The vectors
V
{\displaystyle {\mathcal {V}}}
of an oriented matroid satisfy the following axioms:
∅
∈
V
{\displaystyle \emptyset \in {\mathcal {V}}}
V
=
−
V
{\displaystyle {\mathcal {V}}=-{\mathcal {V}}}
for all
X
,
Y
∈
V
{\displaystyle X,Y\in {\mathcal {V}}}
,
X
∘
Y
∈
V
{\displaystyle X\circ Y\in {\mathcal {V}}}
for all
X
,
Y
∈
V
{\displaystyle X,Y\in {\mathcal {V}}}
,
e
∈
X
+
∩
Y
−
{\displaystyle e\in X^{+}\cap Y^{-}}
and
f
∈
(
X
_
∖
Y
_
)
∪
(
Y
_
∖
X
_
)
∪
(
X
+
∩
Y
+
)
∪
(
X
−
∩
Y
−
)
{\displaystyle f\in ({\underline {X}}\setminus {\underline {Y}})\cup ({\underline {Y}}\setminus {\underline {X}})\cup (X^{+}\cap Y^{+})\cup (X^{-}\cap Y^{-})}
, there is a
Z
∈
V
{\displaystyle Z\in {\mathcal {V}}}
, such that
Z
+
⊂
X
+
∪
Y
+
∖
e
{\displaystyle Z^{+}\subset X^{+}\cup Y^{+}\setminus e}
,
Z
−
⊂
X
−
∪
Y
−
∖
e
{\displaystyle Z^{-}\subset X^{-}\cup Y^{-}\setminus e}
, and
f
∈
Z
_
{\displaystyle f\in {\underline {Z}}}
.
The covectors of an oriented matroid are the vectors of its dual oriented matroid.
= Chirotope axioms
=Let
E
{\displaystyle E}
be as above. For each non-negative integer
r
{\displaystyle r}
, a chirotope of rank
r
{\displaystyle r}
is a function
χ
:
E
r
→
{
−
1
,
0
,
1
}
{\displaystyle \chi \colon E^{r}\to \{-1,0,1\}}
that satisfies the following axioms:
(B0) (non-trivial):
χ
{\displaystyle \chi }
is not identically zero
(B1) (alternating): For any permutation
σ
{\displaystyle \sigma }
and
x
1
,
…
,
x
r
∈
E
{\displaystyle x_{1},\dots ,x_{r}\in E}
,
χ
(
x
σ
(
1
)
,
…
,
x
σ
(
r
)
)
=
sgn
(
σ
)
χ
(
x
1
,
…
,
x
r
)
{\displaystyle \chi \left(x_{\sigma (1)},\dots ,x_{\sigma (r)}\right)=\operatorname {sgn} (\sigma )\chi \left(x_{1},\dots ,x_{r}\right)}
, where
sgn
(
σ
)
{\displaystyle \operatorname {sgn} (\sigma )}
is the sign of the permutation.
(B2) (exchange): For any
x
1
,
…
,
x
r
,
y
1
,
…
,
y
r
∈
E
{\displaystyle x_{1},\dots ,x_{r},y_{1},\dots ,y_{r}\in E}
such that
χ
(
y
i
,
x
2
,
…
,
x
r
)
χ
(
y
1
,
…
,
y
i
−
1
,
x
1
,
y
i
+
1
,
…
,
y
r
)
≥
0
{\displaystyle \chi (y_{i},x_{2},\dots ,x_{r})\chi (y_{1},\dots ,y_{i-1},x_{1},y_{i+1},\dots ,y_{r})\geq 0}
for each
i
{\displaystyle i}
, then we also have
χ
(
x
1
,
…
,
x
r
)
χ
(
y
1
,
…
,
y
r
)
≥
0
{\displaystyle \chi \left(x_{1},\dots ,x_{r}\right)\chi \left(y_{1},\dots ,y_{r}\right)\geq 0}
.
The term chirotope is derived from the mathematical notion of chirality, which is a concept abstracted from chemistry, where it is used to distinguish molecules that have the same structure except for a reflection.
= Equivalence
=Every chirotope of rank
r
{\displaystyle r}
gives rise to a set of bases of a matroid on
E
{\displaystyle E}
consisting of those
r
{\displaystyle r}
-element subsets that
χ
{\displaystyle \chi }
assigns a nonzero value. The chirotope can then sign the circuits of that matroid. If
C
{\displaystyle C}
is a circuit of the described matroid, then
C
⊂
{
x
1
,
…
,
x
r
,
x
r
+
1
}
{\displaystyle C\subset \{x_{1},\dots ,x_{r},x_{r+1}\}}
where
{
x
1
,
…
,
x
r
}
{\displaystyle \{x_{1},\dots ,x_{r}\}}
is a basis. Then
C
{\displaystyle C}
can be signed with positive elements
C
+
=
{
x
i
:
(
−
1
)
i
χ
(
x
1
,
…
,
x
i
−
1
,
x
i
+
1
,
…
,
x
r
+
1
)
=
1
}
{\displaystyle C^{+}=\{x_{i}:(-1)^{i}\chi (x_{1},\dots ,x_{i-1},x_{i+1},\dots ,x_{r+1})=1\}}
and negative elements the complement. Thus a chirotope gives rise to the oriented bases of an oriented matroid. In this sense, (B0) is the nonempty axiom for bases and (B2) is the basis exchange property.
Examples
Oriented matroids are often introduced (e.g., Bachem and Kern) as an abstraction for directed graphs or systems of linear inequalities. Below are the explicit constructions.
= Directed graphs
=Given a digraph, we define a signed circuit from the standard circuit of the graph by the following method. The support of the signed circuit
X
_
{\displaystyle \textstyle {\underline {X}}}
is the standard set of edges in a minimal cycle. We go along the cycle in the clockwise or anticlockwise direction assigning those edges whose orientation agrees with the direction to the positive elements
X
+
{\displaystyle \textstyle X^{+}}
and those edges whose orientation disagrees with the direction to the negative elements
X
−
{\displaystyle \textstyle X^{-}}
. If
C
{\displaystyle \textstyle {\mathcal {C}}}
is the set of all such
X
{\displaystyle \textstyle X}
, then
C
{\displaystyle \textstyle {\mathcal {C}}}
is the set of signed circuits of an oriented matroid on the set of edges of the directed graph.
If we consider the directed graph on the right, then we can see that there are only two circuits, namely
{
(
1
,
2
)
,
(
1
,
3
)
,
(
3
,
2
)
}
{\displaystyle \textstyle \{(1,2),(1,3),(3,2)\}}
and
{
(
3
,
4
)
,
(
4
,
3
)
}
{\displaystyle \textstyle \{(3,4),(4,3)\}}
. Then there are only four possible signed circuits corresponding to clockwise and anticlockwise orientations, namely
{
(
1
,
2
)
,
−
(
1
,
3
)
,
−
(
3
,
2
)
}
{\displaystyle \textstyle \{(1,2),-(1,3),-(3,2)\}}
,
{
−
(
1
,
2
)
,
(
1
,
3
)
,
(
3
,
2
)
}
{\displaystyle \textstyle \{-(1,2),(1,3),(3,2)\}}
,
{
(
3
,
4
)
,
(
4
,
3
)
}
{\displaystyle \textstyle \{(3,4),(4,3)\}}
, and
{
−
(
3
,
4
)
,
−
(
4
,
3
)
}
{\displaystyle \textstyle \{-(3,4),-(4,3)\}}
. These four sets form the set of signed circuits of an oriented matroid on the set
{
(
1
,
2
)
,
(
1
,
3
)
,
(
3
,
2
)
,
(
3
,
4
)
,
(
4
,
3
)
}
{\displaystyle \textstyle \{(1,2),(1,3),(3,2),(3,4),(4,3)\}}
.
= Linear algebra
=If
E
{\displaystyle \textstyle E}
is any finite subset of
R
n
{\displaystyle \textstyle \mathbb {R} ^{n}}
, then the set of minimal linearly dependent sets forms the circuit set of a matroid on
E
{\displaystyle \textstyle E}
. To extend this construction to oriented matroids, for each circuit
{
v
1
,
…
,
v
m
}
{\displaystyle \textstyle \{v_{1},\dots ,v_{m}\}}
there is a minimal linear dependence
∑
i
=
1
m
λ
i
v
i
=
0
{\displaystyle \sum _{i=1}^{m}\lambda _{i}v_{i}=0}
with
λ
i
∈
R
{\displaystyle \textstyle \lambda _{i}\in \mathbb {R} }
. Then the signed circuit
X
=
{
X
+
,
X
−
}
{\displaystyle \textstyle X=\{X^{+},X^{-}\}}
has positive elements
X
+
=
{
v
i
:
λ
i
>
0
}
{\displaystyle \textstyle X^{+}=\{v_{i}:\lambda _{i}>0\}}
and negative elements
X
−
=
{
v
i
:
λ
i
<
0
}
{\displaystyle \textstyle X^{-}=\{v_{i}:\lambda _{i}<0\}}
. The set of all such
X
{\displaystyle \textstyle X}
forms the set of signed circuits of an oriented matroid on
E
{\displaystyle \textstyle E}
. Oriented matroids that can be realized this way are called representable.
Given the same set of vectors
E
{\displaystyle E}
, we can define the same oriented matroid with a chirotope
χ
:
E
r
→
{
−
1
,
0
,
1
}
{\displaystyle \chi :E^{r}\rightarrow \{-1,0,1\}}
. For any
x
1
,
…
,
x
r
∈
E
{\displaystyle x_{1},\dots ,x_{r}\in E}
let
χ
(
x
1
,
…
,
x
r
)
=
sgn
(
det
(
x
1
,
…
,
x
r
)
)
{\displaystyle \chi (x_{1},\dots ,x_{r})=\operatorname {sgn} (\det(x_{1},\dots ,x_{r}))}
where the right hand side of the equation is the sign of the determinant. Then
χ
{\displaystyle \chi }
is the chirotope of the same oriented matroid on the set
E
{\displaystyle E}
.
= Hyperplane arrangements
=A real hyperplane arrangement
A
=
{
H
1
,
…
,
H
n
}
{\displaystyle {\mathcal {A}}=\{H_{1},\ldots ,H_{n}\}}
is a finite set of hyperplanes in
R
d
{\displaystyle \mathbb {R} ^{d}}
, each containing the origin. By picking one side of each hyperplane to be the positive side, we obtain an arrangement of half-spaces. A half-space arrangement breaks down the ambient space into a finite collection of cells, each defined by which side of each hyperplane it lands on. That is, assign each point
x
∈
R
d
{\displaystyle x\in \mathbb {R} ^{d}}
to the signed set
X
=
(
X
+
,
X
−
)
{\displaystyle X=(X^{+},X^{-})}
with
i
∈
X
+
{\displaystyle i\in X^{+}}
if
x
{\displaystyle x}
is on the positive side of
H
i
{\displaystyle H_{i}}
and
i
∈
X
−
{\displaystyle i\in X^{-}}
if
x
{\displaystyle x}
is on the negative side of
H
i
{\displaystyle H_{i}}
. This collection of signed sets defines the set of covectors of the oriented matroid, which are the vectors of the dual oriented matroid.
= Convex polytope
=Günter M. Ziegler introduces oriented matroids via convex polytopes.
Results
= Orientability
=A standard matroid is called orientable if its circuits are the supports of signed circuits of some oriented matroid. It is known that all real representable matroids are orientable. It is also known that the class of orientable matroids is closed under taking minors, however the list of forbidden minors for orientable matroids is known to be infinite. In this sense, oriented matroids is a much stricter formalization than regular matroids.
= Duality
=Just as a matroid has a unique duals, an oriented matroid has a unique dual, often called its "orthogonal dual". What this means is that the underlying matroids are dual and that the cocircuits are signed so that they are "orthogonal" to every circuit. Two signed sets are said to be orthogonal if the intersection of their supports is empty or if the restriction of their positive elements to the intersection and negative elements to the intersection form two nonidentical and non-opposite signed sets. The existence and uniqueness of the dual oriented matroid depends on the fact that every signed circuit is orthogonal to every signed cocircuit.
To see why orthogonality is necessary for uniqueness one needs only to look to the digraph example above. We know that for planar graphs the dual of the circuit matroid is the circuit matroid of the graph's planar dual. Thus there are as many different dual pairs of oriented matroids based on the matroid of the graph as there are ways to orient the graph and in a corresponding way its dual.
To see the explicit construction of this unique orthogonal dual oriented matroid, consider an oriented matroid's chirotope
χ
:
E
r
→
{
−
1
,
0
,
1
}
{\displaystyle \chi :E^{r}\rightarrow \{-1,0,1\}}
. If we consider a list of elements of
x
1
,
…
,
x
k
∈
E
{\displaystyle x_{1},\dots ,x_{k}\in E}
as a cyclic permutation then we define
sgn
(
x
1
,
…
,
x
k
)
{\displaystyle \operatorname {sgn} (x_{1},\dots ,x_{k})}
to be the sign of the associated permutation. If
χ
∗
:
E
|
E
|
−
r
→
{
−
1
,
0
,
1
}
{\displaystyle \chi ^{*}:E^{|E|-r}\rightarrow \{-1,0,1\}}
is defined as
χ
∗
(
x
1
,
…
,
x
r
)
↦
χ
(
x
r
+
1
,
…
,
x
|
E
|
)
sgn
(
x
1
,
…
,
x
r
,
x
r
+
1
,
…
,
x
|
E
|
)
,
{\displaystyle \chi ^{*}(x_{1},\dots ,x_{r})\mapsto \chi (x_{r+1},\dots ,x_{|E|})\operatorname {sgn} (x_{1},\dots ,x_{r},x_{r+1},\dots ,x_{|E|}),}
then
χ
∗
{\displaystyle \chi ^{*}}
is the chirotope of the unique orthogonal dual oriented matroid.
= Topological representation
=Not all oriented matroids are representable—that is, not all have realizations as point configurations, or, equivalently, hyperplane arrangements. However, in some sense, all oriented matroids come close to having realizations as hyperplane arrangements. In particular, the Folkman–Lawrence topological representation theorem states that any oriented matroid has a realization as an arrangement of pseudospheres. A
d
{\displaystyle d}
-dimensional pseudosphere is an embedding of
e
:
S
d
↪
S
d
+
1
{\displaystyle e:S^{d}\hookrightarrow S^{d+1}}
such that there exists a homeomorphism
h
:
S
d
+
1
→
S
d
+
1
{\displaystyle h:S^{d+1}\rightarrow S^{d+1}}
so that
h
∘
e
{\displaystyle h\circ e}
embeds
S
d
{\displaystyle S^{d}}
as an equator of
S
d
+
1
{\displaystyle S^{d+1}}
. In this sense a pseudosphere is just a tame sphere (as opposed to wild spheres). A pseudosphere arrangement in
S
d
{\displaystyle S^{d}}
is a collection of pseudospheres that intersect along pseudospheres. Finally, the Folkman–Lawrence topological representation theorem states that every oriented matroid of rank
d
+
1
{\displaystyle d+1}
can be obtained from a pseudosphere arrangement in
S
d
{\displaystyle S^{d}}
. It is named after Jon Folkman and Jim Lawrence, who published it in 1978.
= Geometry
=The theory of oriented matroids has influenced the development of combinatorial geometry, especially the theory of convex polytopes, zonotopes, and configurations of vectors (equivalently, arrangements of hyperplanes). Many results—Carathéodory's theorem, Helly's theorem, Radon's theorem, the Hahn–Banach theorem, the Krein–Milman theorem, the lemma of Farkas—can be formulated using appropriate oriented matroids.
= Optimization
=The development of an axiom system for oriented matroids was initiated by R. Tyrrell Rockafellar to describe the sign patterns of the matrices arising through the pivoting operations of Dantzig's simplex algorithm; Rockafellar was inspired by Albert W. Tucker's studies of such sign patterns in "Tucker tableaux".
The theory of oriented matroids has led to breakthroughs in combinatorial optimization. In linear programming, it was the language in which Robert G. Bland formulated his pivoting rule, by which the simplex algorithm avoids cycles. Similarly, it was used by Terlaky and Zhang to prove that their criss-cross algorithms have finite termination for linear programming problems. Similar results were made in convex quadratic programming by Todd and Terlaky. It has been applied to linear-fractional programming, quadratic-programming problems, and linear complementarity problems.
Outside of combinatorial optimization, oriented matroid theory also appears in convex minimization in Rockafellar's theory of "monotropic programming" and related notions of "fortified descent". Similarly, matroid theory has influenced the development of combinatorial algorithms, particularly the greedy algorithm. More generally, a greedoid is useful for studying the finite termination of algorithms.
References
Further reading
= Books
=Bachem, Achim; Kern, Walter (1992). Linear Programming Duality: An Introduction to Oriented Matroids. Universitext. Springer-Verlag. doi:10.1007/978-3-642-58152-6. ISBN 978-3-540-55417-2. MR 1230380.
Björner, Anders; Las Vergnas, Michel; Sturmfels, Bernd; White, Neil; Ziegler, Günter (1999). Oriented Matroids. Encyclopedia of Mathematics and Its Applications. Vol. 46 (2nd ed.). Cambridge University Press. ISBN 978-0-521-77750-6. Zbl 0944.52006.
Bokowski, Jürgen (2006). Computational oriented matroids. Equivalence classes of matrices within a natural framework. Cambridge University Press. ISBN 978-0-521-84930-2. Zbl 1120.52011.
Lawler, Eugene (2001). Combinatorial Optimization: Networks and Matroids. Dover. ISBN 978-0-486-41453-9. Zbl 1058.90057.
Evar D. Nering and Albert W. Tucker, 1993, Linear Programs and Related Problems, Academic Press. (elementary)
Rockafellar, R. Tyrrell (1984). Network Flows and Monotropic Optimization. Wiley-Interscience. republished by Athena Scientific of Dimitri Bertsekas, 1998.
Ziegler, Günter M. (1994). Lectures on Polytopes. New York: Springer-Verlag.
Richter-Gebert, Jürgen; Ziegler, Günter M. (1997). "Oriented Matroids". In Goodman, Jacob E.; O'Rourke, Joseph (eds.). Handbook of Discrete and Computational Geometry. Boca Raton: CRC Press. pp. 111–132. ISBN 9780849385247.
= Articles
=A. Bachem, A. Wanka, Separation theorems for oriented matroids, Discrete Math. 70 (1988) 303–310.
Bland, Robert G. (1977). "New finite pivoting rules for the simplex method". Mathematics of Operations Research. 2 (2): 103–107. doi:10.1287/moor.2.2.103.
Folkman, Jon; Lawrence, Jim (October 1978). "Oriented Matroids". Journal of Combinatorial Theory. Series B. 25 (2): 199–236. doi:10.1016/0095-8956(78)90039-4.
Fukuda, Komei; Terlaky, Tamás (1997). Thomas M. Liebling; Dominique de Werra (eds.). "Criss-cross methods: A fresh view on pivot algorithms" (PDF). Mathematical Programming, Series B. 79 (1–3). Amsterdam: North-Holland Publishing Co.: 369–395. doi:10.1007/BF02614325. MR 1464775. S2CID 2794181.
Fukuda, Komei; Namiki, Makoto (March 1994). "On extremal behaviors of Murty's least index method". Mathematical Programming. 64 (1): 365–370. doi:10.1007/BF01582581. MR 1286455. S2CID 21476636.
Illés, Tibor; Szirmai, Ákos; Terlaky, Tamás (1999). "The finite criss-cross method for hyperbolic programming". European Journal of Operational Research. 114 (1): 198–214. CiteSeerX 10.1.1.36.7090. doi:10.1016/S0377-2217(98)00049-6. ISSN 0377-2217.
R. Tyrrell Rockafellar (1969). The elementary vectors of a subspace of
R
n
{\displaystyle R^{n}}
, in Combinatorial Mathematics and its Applications, R. C. Bose and T. A. Dowling (eds.), Univ. of North Carolina Press, pp. 104–127.
Roos, C. (1990). "An exponential example for Terlaky's pivoting rule for the criss-cross simplex method". Mathematical Programming. Series A. 46 (1): 79–84. doi:10.1007/BF01585729. MR 1045573. S2CID 33463483.
Terlaky, T. (1985). "A convergent criss-cross method". Optimization: A Journal of Mathematical Programming and Operations Research. 16 (5): 683–690. doi:10.1080/02331938508843067. ISSN 0233-1934. MR 0798939.
Terlaky, Tamás (1987). "A finite crisscross method for oriented matroids". Journal of Combinatorial Theory. Series B. 42 (3): 319–327. doi:10.1016/0095-8956(87)90049-9. ISSN 0095-8956. MR 0888684.
Terlaky, Tamás; Zhang, Shu Zhong (1993). "Pivot rules for linear programming: A Survey on recent theoretical developments". Annals of Operations Research. 46–47 (1): 203–233. CiteSeerX 10.1.1.36.7658. doi:10.1007/BF02096264. ISSN 0254-5330. MR 1260019. S2CID 6058077.
Todd, Michael J. (1985). "Linear and quadratic programming in oriented matroids". Journal of Combinatorial Theory. Series B. 39 (2): 105–133. doi:10.1016/0095-8956(85)90042-5.
Wang, Zhe Min (1987). "A finite conformal-elimination free algorithm over oriented matroid programming". Chinese Annals of Mathematics (Shuxue Niankan B Ji). Series B. 8 (1): 120–125. ISSN 0252-9599. MR 0886756.
= On the web
=Ziegler, Günter (1998). "Oriented Matroids Today". The Electronic Journal of Combinatorics: DS4: Sep 10–1998. doi:10.37236/25.
Malkevitch, Joseph. "Oriented Matroids: The Power of Unification". Feature Column. American Mathematical Society. Retrieved 2009-09-14.
External links
Komei Fukuda (ETH Zentrum, Zurich) with publications including Oriented matroid programming (1982 Ph.D. thesis)
Tamás Terlaky (Lehigh University) with publications
Kata Kunci Pencarian:
- Geometri diskrit
- Oriented matroid
- Matroid
- Discrete geometry
- Mnëv's universality theorem
- Bland's rule
- Zonohedron
- Arrangement of hyperplanes
- Graphic matroid
- Criss-cross algorithm
- Sylvester–Gallai theorem
