Search Results for ""

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.

The surface given by the parametric equations x = e^(bv)cosv+e^(av)cosucosv (1) y = e^(bv)sinv+e^(av)cosusinv (2) z = e^(av)sinu. (3) For a=b=1, the coefficients of the first ...

The first corona of a tile is the set of all tiles that have a common boundary point with that tile (including the original tile itself). The second corona is the set of ...

A measure nu of a strange attractor which allows the presence of chaos to be distinguished from random noise. It is related to the capacity dimension D and information ...