Simplifying the Complexity in the Problem of Choosing the Best Private-Sector Partner

Author:

Qiu Peiyao1,Sorourkhah Ali2ORCID,Kausar Nasreen3,Cagin Tonguc4,Edalatpanah Seyyed Ahmad5ORCID

Affiliation:

1. Business School of Nanjing Normal University, Nanjing 210024, China

2. Department of Management, Ayandegan Institute of Higher Education, Tonekabon 4681853617, Iran

3. Department of Mathematics, Faculty of Arts and Science, Yildiz Technical University, Esenler, Istanbul 34220, Turkey

4. Department of Mathematics & Statistics, American University of the Middle East, Egaila 54200, Kuwait

5. Department of Mathematics, Ayandegan Institute of Higher Education, Tonekabon 4681853617, Iran

Abstract

Governments frequently partner with the private sector to provide infrastructure and public services. These cooperations, known as public–private partnerships (PPPs), have often failed. Sometimes, due to the problem’s complexity, the public sector cannot choose the right partner for these projects, which is one of the main reasons for failures. Complexity in such problems is associated with a large number of indicators, imprecise judgments of decision-makers or problem owners, and the unpredictability of the environment (under conditions of uncertainty). Therefore, presenting a simplified algorithm for this complicated process is the primary goal of the current research so that it can consider the problem’s various dimensions. While many researchers address the critical risk factors (CRFs) and others focus on key performance indicators (KPIs), this research has considered both CRFs and KPIs to choose the best private-sector partner. In addition, we used single-valued neutrosophic sets (SVNSs) to collect decision-makers’ views, which can handle ambiguous, incomplete, or imprecise information. Next, by defining the ideal alternative and using the similarity measure, we specified the ranks of the alternative. Additionally, to face the uncertain environment, we examined the performance of options in four future scenarios. The steps of the proposed algorithm are explained in the form of a numerical example. The results of this research showed that by employing a simple algorithm, even people who do not have significant operations research knowledge could choose the best option by paying attention to the dimensions of the problem complexity.

Funder

Jiangsu Postgraduate Scientific Research Innovation Plan Project

Publisher

MDPI AG

Subject

Information Systems and Management,Computer Networks and Communications,Modeling and Simulation,Control and Systems Engineering,Software

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3