An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes (Q2276885)

A bilinear function f(\(\cdot)\) is minimized over a D-polytope, i.e. a polytope with ``downward'' sloping edges. An explicit characterization of convex envelopes of f(\(\cdot)\) is derived which may be useful in constructing branch-and-bound algorithms. Some generalizations to the non D-polytopes are discussed.