George Dantzig and Leonid Khachyan

In this part we will not progress on the diameter problem that we discussed in the earlier posts but will rather describe a closely related problem for directed graphs associated with **ordered** families of sets. The role models for these directed graphs are the directed graphs of polytopes where the direction of the edges is described by a linear objective function.

### 7. Linear programming and the simplex algorithm.

Our diameter problem for families of sets was based on a mathematical abstraction (and a generalization) of the Hirsch Conjecture which asserts that the diameter of the graph of a -polytope with facets is at most . Hirsch, in fact, made the conjecture also for graphs of unbounded polyhedra – namely the intersection of closed halfspaces in . But in the unbounded case, Klee and Walkup found a counterexample with diameter []. The abstract problem we considered extends also to the unbounded case and [] is the best known lower bound for the abstract case as well. It is not known if there is a polynomial (in terms of and ) upper bound for the diameter of graphs of d-polytopes with n facets.

Hirsch’s conjecture was motivated by the simplex algorithm for linear programming. Let us talk a little more about it: Linear programming is the problem of maximizing a linear objective function subject to a system of n linear inequalities in the variables .

,

,

…

,

The set of solutions to the system of inequalities is a convex polyhedron. (If it is bounded it is a polytope.) A linear objective function makes a graph of a polytope (or a polyhedron) into a digraph (directed graph). If you like graphs you would love digraphs, and if you like graphs of polytopes, you would like the digraphs associated with them.

The geometric description of Dantzig’s simplex algorithm is as follows: the system of inequalities describes a convex d-dimensional polyhedron . (This polyhedron is called the feasible polyhedron.) The maximum of is attained at a face of . We start with an initial vertex (extreme point) of the polyhedron and look at its neighbors in . Unless there is a neighbor of that satisfies . When you find such a vertex move from to and repeat!

### 8. Abstract objective functions and unique sink orientation.

Let be a simple d-polytope and let be a linear objective function which is not constant on any edge of the polytope. Remember, the graph of , is a -regular graph. We can now direct every edge from to if . Here are two important properties of this digraph.

(AC) It is acyclic! (no cycles)

(US’) It has a unique SINK, namely a unique vertex such that all edges containing it are directed towards it.

The unique sink property is in fact the property that enables the simplex algorithm to work!

When we consider a face of the polytope and its own graph then again our linear objective function induces an orientation of the edges of which is acyclic and also has the unique sink property. Every subgraph of an acyclic graph is acyclic. But having the unique sink property for a graph does not imply it for a subgraph. We can now describe the general unique sink properties of digraphs of polytopes:

(US) For every face F of the polytope, the directed graph induced on the vertices of has a unique sink.

A unique sink acyclic orientation of the graph of a polytope is an orientation of the edges of the graph which satisfies properties (AC) and (US).

An abstract objective function of a -polytope is an ordering of the vertices of the polytope such that the directed graph obtained by directing an edge from to if is a unique sink acyclic orientation. (Of course, coming from an ordering the orientation is automatically acyclic.)

Continue reading →