Abstract We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well higher-order maps. show the computational complexity of above-mentioned operations for zonotopes at most in size. The fact are generalizations polytopes, Taylor models, ellipsoids ...