1) Chem.: Composed of only one → substance
or → element.
2) Math.: Consisting of, involving, or describable by
→ terms of the → first degree.
3) Music: Uncompounded or without overtones.

M.E., from O.Fr. simple, from L. simplus "simple, single," variant
of simplex, from PIE root *sem- "one, together;"
cf. Pers. ham "together," → com-,
Skt. sam "together;" + *plac- "-fold," from PIE *plek- "to plait,"
→ multiply.

The motion of a body subjected to a restraining force which is directly proportional to
the displacement from a fixed point in the line of motion.
The equation of simple harmonic motion is given by
x = A sin(ωt + θ_{0}), where
x is the body's displacement from equilibrium position,
A is the → amplitude, or the magnitude of harmonic
oscillations, ω is the → angular frequency,
t is the time elapsed, and θ_{0} is the
→ initial phase angle.

An oscillator whose force is proportional to its extension, according to
→ Hooke's law. The way the oscillator moves is called
→ simple harmonic motion.

A generalization of the simplest closed configuration that can be made
from straight line segments. For example, a → triangle
is a 2-simplex because it is in two → dimensions,
and → tetrahedron
is a 3-simplex because it is in three dimensions (Steven Schwartzman,
An Etymological Dictionary of Mathematical Terms Used in
English, 1994).

Simplex, literally "uncomplicated, → simple,"
from sim-, from PIE root *sem- "one, once, together" + plek- "to fold."
"folded [only] once."

Taktâft, literally "folded once," from tak "→ single, alone," +
tâft, contraction of tâfté "plated, twisted, fold," as in
hamtâft, → complex.

simplex method

روش ِ تکتافتی

raveš-e taktâfti

Fr.: méthode du simplexe

An → algorithm for solving the classical
→ linear programming problem;
developed by George B. Dantzig in 1947. The simplex method is an
→ iterative method, solving a system of
→ linear equations in each of
its steps, and stopping when either the → optimum
is reached, or the
solution proves infeasible. The basic method remained pretty much the
same over the years, though there were many refinements targeted at
improving performance (e.g. using sparse matrix techniques), numerical
accuracy and stability, as well as solving special classes of
problems, such as mixed-integer programming
(Free On-Line Dictionary of Computing, FOLDOC).