We propose two new mathematical formulations of the planning problem of publicprivate partnership. One of the models is bilevel, and the other is one-level. We characterize the computational complexity and develop some algorithms for solving these problems. A special model polygon is built to carry out computational experiment. The polygon takes into account the specificity of the original information base. Basing on numerical experiments, we analyze the properties of the optimal solutions. This allows us to assess the adequacy of the underlying assumptions of the models with the current state of affairs in the field of project management of public-private partnership.