Kuhn-Tucker Theorem
A theorem in nonlinear programming which states that if a regularity condition holds and 
and the functions 
areconvex, then a solution 
which satisfies the conditions for a Vector of multipliers 
is aGlobal Minimum. The Kuhn-Tucker theorem is a generalization of Lagrange Multipliers. Farkas's Lemma is key in proving this theorem.
- Rosenbrock Methods
- Rotation
- Rotation Formula
- Rotation Group
- Rotation Matrix
- Rotation Number
- Rotation Operator
- Roth's Removal Rule
- Roth's Theorem
- Rotkiewicz Theorem
- Rotoinversion
- Rotor
- Rotunda
- Rouché's Theorem
- Roulette
- Round
- Rounding
- Routh-Hurwitz Theorem
- Routh's Theorem
- RSA Encryption
- RSA Number
- Rubber-Sheet Geometry
- Rubik's Clock
- Rubik's Cube
- Rudin-Shapiro Sequence