Search Results for ""

A subset A of a vector space V is said to be convex if lambdax+(1-lambda)y for all vectors x,y in A, and all scalars lambda in [0,1]. Via induction, this can be seen to be ...

A set X is a called a "convex cone" if for any x,y in X and any scalars a>=0 and b>=0, ax+by in X.

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.

Construct a 5×5×5 cube from thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2, and three 1×1×3 blocks.

The look and say sequence generated from a starting digit of 3, as given by Vardi (1991).

A sphere with four punctures occurring where a knot passes through the surface.

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

The plane spanned by two coordinate axes in the three-dimensional Euclidean space. The coordinate plane spanned by the x- and the y-axis is called xy-plane.

A function that joins univariate distribution functions to form multivariate distribution functions. A two-dimensional copula is a function C:I^2->I such that C(0,t)=C(t,0)=0 ...