Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme

Computation, Optimization and Control

Named individual objects belonging to computation, optimization and control theory, the branch that studies how a quantity is computed, optimized or steered toward a target under constraints. Belongs here: a specific, individually notable algorithm, optimization problem or control-theoretic construction studied as an object in its own right, such as a named linear program, a specific automaton or a particular optimal-control formulation that carries its own identity separate from the general method it illustrates. Does not belong here: the branch entity Computation, Optimization and Control itself; and the general concepts and methods the field studies, which are typed as concept or theorem rather than mathematical-object when they name a general technique or claim rather than one specific instance.

Facts
Comparison
Era Of Emergence
1947 1
Browse By
Sources
1. Wikipedia: Mathematical Optimization
Wikimedia FoundationHistory section
Quote, History section
Dantzig published the Simplex algorithm in 1947, and also John von Neumann and other researchers worked on the theoretical aspects of linear programming (like the theory of duality) around the same time.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.