Maximum cliques of the transitive closure of a chordal DAG
I think you can extend Vinicius dos Santos' idea to show that no polynomial bound is possible.
Consider a graph on $n$ vertices divided into $d\geq 1$ groups of size about $n/d$ as follows:

Its transitive closure has about $(\frac{n}{d})^d$ maximal (undirected) cliques.