Volume Maximizing Convex Shape

Let $C$ range over convex planar regions of area one. Choose two boundary points that divide $\partial C$ into equal-length chains, identify corresponding points of the chains, and consider the resulting folded convex surface. Determine the maximum achievable enclosed volume and characterize the optimizing region and fold.