1. Linear Programming Problems 1.1. Formulation of Linear Programming Problems 1.2. Examples 1.3. Different Forms of Programs and Transformations 2. Primal and Dual Programs and Polyhedra 2.1 Duality 2.2. Linear Inequalities and Polyhedra 3. The Simplex Method 3.1. The Restriction-oriented Simplex Method 3.2. The Variable-oriented Simplex Method 3.3. Modifications of Methods and Problems 3.4. T...

The sensitization of herpes simplex virus by immunoglobulin G (IgG) antibodies was studied. Although herpes simplex virus sensitized by IgG could not be neutralized by IgA antibodies known to neutralize a similar number of unsensitized viruses, this protection could be overcome by larger amounts of IgA antibodies. This suggests that the effective neutralization of herpes simplex virus in ocular...

By integrating the underlying developmental mechanisms for the phenotypic formation of traits into a mapping framework, functional mapping has emerged as an important statistical approach for mapping complex traits. In this note, we explore the feasibility of using the simplex algorithm as an alternative to solve the mixture-based likelihood for functional mapping of complex traits. The results...

We will derive two results of the primal simplex method by constructing simple LP instances on 0-1 polytopes. First, for any 0-1 polytope and any of its two vertices, we can construct an LP instance for which the simplex method finds a path between them, whose length is at most the dimension of the polytope. This proves a well-known result that the diameter of any 0-1 polytope is bounded by its...

A simplex of a graph G is a subgraph of G which is a complete graph. The simplex graph Simp(G) of G is the graph whose vertex set is the set of all simplices of G and in which two vertices are adjacent if and only if they have a non-empty intersection. The simplex graph operator is the operator which to every graph G assigns its simplex graph Simp(G). The paper studies graphs which are fixed in...

Normal bone marrow cells from a donor positive for herpes simplex virus were transformed with Epstein-Barr virus. The resulting lymphoblastoid cell line has secreted immunoglobulin G1 of the kappa type continuously for 2 years. This immunoglobulin, detected both on the cell surface and in the cytoplasm, reacts with cells infected with herpes simplex virus. It defines an antigen that comigrates ...

We study permutation type solutions to n-simplex equations, that is, solutions whose matrix form can be written as R1n ii...in = ∏n α=1 δ jα Aαiβ+Bα with some n × n matrix A and vector B, both over ZD. With this ansatz the D n(n+1) equations of the n-simplex equation reduce to an [12n(n+1)+1]× [ 1 2n(n+1)+1] matrix equation over ZD. We have completely analyzed the 2-, 3and 4-simplex equations i...

We define Hamiltonian simplex differential graded algebras (DGA) with differentials that deform the high-energy symplectic homology differential and wrapped Floer homology differential in the cases of closed and open strings in a Liouville manifold of finite type, respectively. The order-m term in the differential is induced by varying natural degree-m coproducts over an .m 1/–simplex, where th...

Given a point on the standard simplex, we calculate a proximal point on the regular grid which is closest with respect to any norm in a large class, including all `-norms for p ≥ 1. We show that the minimal `-distance to the regular grid on the standard simplex can exceed one, even for very fine mesh sizes in high dimensions. Furthermore, for p = 1, the maximum minimal distance approaches the `...