Where does simplex collide?

In mathematical optimization, the simplex method is Dantzig's algorithm for linear programming: it moves from vertex to vertex along the edges of the feasible polytope, improving the objective at each step until it reaches an optimum. Dantzig's Linear programming and extensions gives the full development, the method taking its name from the simplex, the simplest such geometric body. The referent is a vertex-traversing solution procedure for linear programs, judged by convergence and the number of pivots, and it shares only the word with a one-way radio channel or a herpesvirus.[1]

Unit

A pivoting procedure that solves a linear program by traversing polytope vertices

Recovery means

Not applicable

Measured by

Assessed by number of pivot steps, convergence to the optimal vertex, and computational cost on a given program

In virology and medicine, simplex names the herpes simplex viruses (HSV-1 and HSV-2), the agents of recurrent oral and genital lesions, so called to distinguish this simple, recurring presentation from the dermatomal zoster of varicella-zoster. Whitley and Roizman's 2001 Herpes simplex virus infections reviews the viruses' latency in sensory ganglia and reactivation. The referent is a specific pair of human herpesviruses and the disease they cause, tracked by serology, viral detection, and lesion recurrence, and it is wholly unrelated to an optimization algorithm or a transmission direction.[2]

Unit

Infection by the herpes simplex viruses (HSV-1 / HSV-2)

Recovery means

Not applicable

Measured by

Established by viral PCR or culture, type-specific serology, and the pattern of lesion recurrence