Abstract:
We propose two new mathematical formulation of the planning problem of public-private partnership. One of the models is bilevel and the other is one-level. The results that characterize the computational complexity of these models are shown. We develop some exact and approximate algorithms for solving these problems. A special model polygon is built to carry out a computational experiment. The polygon takes into account the specificity of the original information base. On the basis of the numerical results of the experiment, we compare the properties of optimal solutions in different models. 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. Ill. 13, bibliogr. 16.
Keywords:public-private partnership, bilevel problem, approximation hierarchy, NPO-hard problem, class $\Sigma^P_2O$, hybrid algorithm, local search.