Convex Optimization Theory
The problem of maximizing a linear function over a convex polyhedron, also known as Operations Research orOptimization Theory. The general problem of convex optimization is to find the minimum of a convex (or quasiconvex)function 
on a Finite-dimensional convex body 
. Methods of solution include Levin's algorithm and the method ofcircumscribed Ellipsoids, also called the Nemirovsky-Yudin-Shor method.
References
Tokhomirov, V. M. ``The Evolution of Methods of Convex Optimization.'' Amer. Math. Monthly 103, 65-71, 1996.
- Rectangular Parallelepiped
- Rectangular Projection
- Rectifiable Current
- Rectifiable Set
- Rectification
- Rectifying Latitude
- Rectifying Plane
- Recurrence Relation
- Recurrence Sequence
- Recurring Digital Invariant
- Recursion
- Recursive Function
- Recursive Monotone Stable Quadrature
- Red-Black Tree
- Red Net
- Reduced Amicable Pair
- Reduced Fraction
- Reduced Latitude
- Reducible Crossing
- Reducible Matrix
- Reducible Representation
- Reduction of Order
- Reduction Theorem
- Redundancy
- Reeb Foliation