返回
An alternative efficient representation for the project portfolio selection problem
DOI:10.1016/j.ejor.2019.08.022.png)
摘要
En 中文
Project portfolio selection problem (PPSP) is usually formulated as a mixed integer polynomial program with cross-product terms. The problem is hard to solve due to the non-convex cross-product terms involved. To find an exact optimal solution, currently available methods adopt different linearization techniques to handle the cross-product terms and then utilize a branch-and-bound scheme for computations. This study proposes an alternative efficient representation for PPSP using fewer continuous variables than the current methods to achieve global optimum. Numerical experiments are presented to demonstrate the effectiveness and efficiency of the proposed method. In addition, the proposed method is integrated with a general binary cut scheme for identifying all alternative solutions for decision makers to consider better options. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Project portfolio selection problem
Mixed integer polynomial program
Linearization technique
Alternative solution
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Selecting balanced portfolios of R&D projects with interdependencies: A Cross-Entropy based methodology基于交叉熵的R & D项目均衡投资组合选择方法
TECHNOVATION
IF10.9

