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.
- Convex Polyhedron
- Convolution
- Convolution Theorem
- Conway-Alexander Polynomial
- Conway Groups
- Conway Notation
- Conway Polyhedron Notation
- Conway Polynomial
- Conway Puzzle
- Conway's Constant
- Conway Sequence
- Conway's Game of Life
- Conway's Knot
- Conway's Knot Notation
- Conway's Life
- Conway Sphere
- Coordinate Geometry
- Coordinates
- Coordinate System
- Coordination Number
- Copeland-Erdös Constant
- Coplanar
- Coprime
- Copson-de Bruijn Constant
- Copson's Inequality