Comparison of models of planning public-private partnership

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)356-369
Number of pages14
JournalJournal of Applied and Industrial Mathematics
Issue number3
Publication statusPublished - 1 Jul 2016


  • approximation hierarchy
  • bilevel problem
  • class Σ O
  • hybrid algorithm
  • local search
  • NPO-hard problem
  • public-private partnership


Dive into the research topics of 'Comparison of models of planning public-private partnership'. Together they form a unique fingerprint.

Cite this