Fair Partitioning of Convex Polygons

Given a convex polygon $P$ and a positive integer $n$, does there always exist a partition $P=P_1\cup\cdots\cup P_n$ into convex pieces with pairwise disjoint interiors such that all $P_i$ have equal area and equal perimeter? If not, characterize existence and optimize total cut length when a partition exists.