Vertex enumeration

In search of invariants. Are there possibly any other characteristics of a graph (or its topological matrix) that are independent of the vertex enumeration mode Yes, such invariant characteristics do exist. However, they can be obtained only after certain refinements of the theory. 

Each vertex enumeration mode corresponds to a definite permutation and its own topological matrix of the graph. Thus, graph is associated with the topological matrix... 

Even with the assumption of vertex constraint maximizers, vertex enumerations with a large number of parameters can be very time-consuming. Algorithms for efficient exploration of the vertices and a proposed flexibility index are presented in Grossmann et al. (1983) and developed further in later papers (Swaney and Grossmann, 1985a, b). These are discussed below. 

Each steady-state worst-case optimization took about 15 minutes to run (on a SPARC 2). The worst-case combination was minimum rate of reaction with the measurement biases pushing the effective setpoints upward by. 25 pH and the minimum buffering. This was a relatively simple worst-case optimization and no projection factor was used. This vertex worst case was in fact correctly chosen a priori based on physical considerations, and was promptly reidentified in the local phase of the constraint maximization. Most of the optimization time was spent verifying this choice of the worst case by vertex enumeration and random search. 

On the third constraint maximization the vertex enumeration and subsequent local search failed to identify a significant violation. The random search therefore was allowed to run until either a violation was found or nrand trials were made. The allotted 1000 random trials failed to identify an increased constraint violation (from which a further local search would have been initiated), so the optimization terminated with the solution noted above. 

The following sections will describe how it is possible to compute the stoichiometric subspace by identifying the bounding constraints in extent space that form the feasible region, which is a function of the reaction stoichiometry and feed point. From this information, it is possible to compute the vertices of the region via vertex enumeration, which is described in Section 8.2.2.2. 

If the positions of the extreme points of S can be identified in extent space, then Equation 8.1 may be invoked to solve for the corresponding points in concentration space. Computing the extreme points of a convex polytope, defined by a set of hyperplane constraints, is termed vertex enumeration. 

The vertex enumeration problem involves computing the extreme points of the convex polytope, defined by the inequality constraints. 

Show that vertex enumeration and facet enumeration are duals of each other by converting the extreme points from Example 2(a) to a system of inequality constraints. Use the vert2con () function. 

We can hence calculate the extreme points of the region defined by Equation 8.2b in extent space by vertex enumeration. The set of extents forming the extreme points of the stoichiometric subspace is found to be [1.0, 0.0], [-0.25, 0.75]T, [0.0, 1.0]T, [0.0, 0.0]. From this set, equivalent extreme points in concentration space may be computed using Equation 8.1. The stoichiometric subspace resides as a two-dimensional subspace in IR . This subspace may be projected onto different component spaces for visualization. A number of example component pairs are shown in Figure 8.4(a). 

Here, rows 1,2, and 3 of A correspond to components A, B, and C, respectively. Next, vertices of individual stoichiometric subspaces Sj and 83 may be found in a standard fashion by solving the vertex enumeration problem for the two separate system of inequalities describing Sj and S2, which are given by... 

A positive consequence of moving hyperplanes via rotations is that there is no need to perform vertex enumeration. Elimination via rotations does not require knowledge of the position of the polytope comers in order to introduce new hyperplanes. When employing rotations, new hyperplanes are introduced as copies of a current hyperplane at existing corners of the polytope. The positions of these corners are already known and vertex enumeration may be avoided as... 

For problems that are bound by the vertex enumeration step, eonstmction times may be improved via rotations. This approach allows for either faster computation times for the same level of accuracy, or more detail to be added for the same computation time. In Figure 8.25, a comparison of con-stmction results for the two-dimensional Van de Vusse kinetics is shown. 

The feasible region is then given by the system of linear inequalities defined by Equation 9.20. In a procedure similar to that given in the steam reforming example, the vertices of the stoichiometric subspace may be computed using a vertex enumeration program. The results of the computation are shown in Figure 9.6. 

---