  Motzkin and Straus established a close connection between the maximum clique
problem and a solution (namely graph-Lagrangians) to the maximum value of a
class of homogeneous quadratic multilinear functions over the standard simplex
of the Euclidean space in 1965. This connection provides a new proof of
Tur\'an's theorem. Recently, an extension of Motzkin-Straus theorem was proved
for non-uniform hypergraphs whose edges contain 1 or 2 vertices in \cite{PPTZ}.
It is interesting if similar results hold for other non-uniform hypergraphs. In
this paper, we give some connection between polynomial programming and the
clique of non-uniform hypergraphs whose edges contain 1, or 2, and more
vertices. Specifically, we obtain some Motzkin-Straus type results in terms of
the graph-Lagrangian of non-uniform hypergraphs whose edges contain 1, or 2,
and more vertices.
