A fuzzy set approach for R&D portfolio selection using a real options valuation model

Making R&D portfolio decision is difficult, because long lead times of R&D and market and technology dynamics lead to unavailable and unreliable collected data for portfolio management. The objective of this research is to develop a fuzzy R&D portfolio selection model to hedge against the R&D uncertainty. Fuzzy set theory is applied to model uncertain and flexible project information. Since traditional project valuation methods often underestimate the risky project, a fuzzy compound-options model is used to evaluate the value of each R&D project. The R&D portfolio selection problem is formulated as a fuzzy zero–one integer programming model that can handle both uncertain and flexible parameters to determine the optimal project portfolio. A new transformation method based on qualitative possibility theory is developed to convert the fuzzy portfolio selection model into a crisp mathematical model from the risk-averse perspective. The transformed model can be solved by an optimization technique. An example is used to illustrate the proposed approach. We conclude that the proposed approach can assist decision makers in selecting suitable R&D portfolios, while there is a lack of reliable project information.     

Stock Evaluation Using a Preference Disaggregation Methodology

This paper presents a real application of a multicriteria decision aid (MCDA) approach to portfolio selection based on preference disaggregation, using ordinal regression and linear programming (UTADIS method; UTilités Additives DIScriminantes). The additive utility functions that are derived through this approach have the extrapolation ability that any new alternative (share) can be easily evaluated and classified into one of several user-predefined groups. The procedure is illustrated with a case study of 98 stocks from the Athens stock exchange, using 15 criteria. The results are encouraging, indicating that the proposed methodology could be used as a tool for the analysis of the portfolio managers' preferences and choices. Furthermore, the comparison with multiple discriminant analysis (either using a stepwise procedure or not) illustrates the superiority of the proposed methodology over a well-known multivariate statistical technique that has been extensively used to study financial decision-making problems.     

PORTFOLIO MODELING IN MULTIPLE-CRITERIA SITUATIONS UNDER UNCERTAINTY: COMMENT

In a recent issue of Decision Sciences, Muhlemann, Lockett, and Gear [8] developed a multiple-objective, stochastic linear programming formulation of the multiperiod portfolio selection problem under uncertainty. The purpose of this note is to offer some extensions to their multicriteria approach which is otherwise viewed as an excellent attempt at modeling realistic aspects of the portfolio selection problem. Further, integer goal programming combined with simulation is suggested as an alternate approach for solving the dynamic multiple-objective problem.     

Management of Energy Technology for Sustainability: How to Fund Energy Technology Research and Development

Operations management methods have been applied profitably to a wide range of technology portfolio management problems, but have been slow to be adopted by governments and policy makers. We develop a framework that allows us to apply such techniques to a large and important public policy problem: energy technology R&D portfolio management under climate change. We apply a multi‐model approach, implementing probabilistic data derived from expert elicitations into a novel stochastic programming version of a dynamic integrated assessment model. We note that while the unifying framework we present can be applied to a range of models and data sets, the specific results depend on the data and assumptions used and therefore may not be generalizable. Nevertheless, the results are suggestive, and we find that the optimal technology portfolio for the set of projects considered is fairly robust to different specifications of climate uncertainty, to different policy environments, and to assumptions about the opportunity cost of investing. We also conclude that policy makers would do better to over‐invest in R&D rather than under‐invest. Finally, we show that R&D can play different roles in different types of policy environments, sometimes leading primarily to cost reduction, other times leading to better environmental outcomes.     

OPTIMAL PORTFOLIO SELECTION WITH UPPER BOUNDS FOR INDIVIDUAL SECURITIES*

In this paper, we consider optimal portfolio selection with no short sales and with upper bounds for individual securities. The solution is reached by directy revising the optimal portfolio without upper bounds. Specifically, our analysis is based on the single-index model, as well as the general multi-index model that provides the return generating process for securities in the arbitrage pricing theory. As demonstrated in a simulation study, the proposed algorithm for optimal portfolio selection usually requires very few iterations. Also, since our approach is developed using intuitive reasoning and simple linear algebra, we are able to provide direct and intuitive justifications for the resulting portfolio choice. Therefore this paper should be of interest to both finance academics and practitioners in portfolio management.     

Portfolio Selection Using Stochastic Dominance Criteria

The direct application of stochastic dominance criteria to portfolio selection problems has been thought impractical because an extremely large number of combinations of returns must be considered. This paper proposes and evaluates a rigorous statistical procedure for sampling the combinations of returns on candidate risky assets so that stochastic dominance criteria may be used directly in an efficient linear programming model for portfolio selection. The sampling scheme exploits the association of the return on each candidate stock with the return on a market index in a manner analogous to the Sharpe single-index model, thereby eliminating the large number of combinations with probabilities close to or equalling zero. Portfolios computed by the proposed linear programming stochastic dominance model are compared with those computed by the single-index quadratic programming model, using 180 months of recent data on a sample of NYSE common stocks.     

考虑不确定履约率的全局鲁棒供应组合决策研究

生产和采购的全球化为供应链企业带来了更多的复杂性与不确定性。收集全面信息和使用有效的工具是控制决策风险、减少不确定性危害的有效途径。在供应商选择与订单分配管理中,供应商履约率是影响企业供应组合决策的主要因素,如何对其进行定量刻画是迫切需要解决的问题。已有的研究通常是由期望方法或鲁棒方法来刻画履约率。然而,期望履约率法往往忽略了履约率的波动性,从而造成需求损失;而鲁棒履约率法通常存在过于保守、退化过于迅速两个缺点,使企业承担不必要的成本。本文研究供应商选择与订单分配决策问题,使用全局鲁棒优化的两个不确定集合来刻画供应商履约率,同时给出了这一问题的确定性鲁棒表达和一种多项式时间求解算法。最后,通过仿真实验证实本文的全局鲁棒优化模型可克服期望模型和一般鲁棒模型的缺点。本文提出的算法能有效求解本文全局鲁棒优化等价确定性问题,为企业的供应商选择和订单分配决策提供更为灵活精确的辅助工具。     

Screening alternatives graphically by an extended case-based distance approach

Screening is a helpful process of multiple criteria decision aid (MCDA) to reduce a larger set of alternatives into a smaller one containing the best alternatives; thereby, decision makers are able to concentrate on evaluating alternatives within a smaller set. Therefore, determining how to assist decision makers in screening is an important issue for MCDA. This study proposes an extended case-based distance approach incorporating the advantages of a case-based distance method, a mixed-integer programming approach of discriminant analysis, and a multidimensional scaling technique to help decision makers screen alternatives visually in MCDA. The proposed approach can screen alternatives by evaluating sets of cases selected by decision makers, providing visual aids to observe decision context, reducing the number of misclassifications, and improving multiple solution problems. An interactive screening procedure is also developed to provide flexibility so that decision makers can check and adjust screening results iteratively.     

Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection

Multi-objective combinatorial optimization (MOCO) problems, apart from being notoriously difficult and complex to solve in reasonable computational time, they also exhibit high levels of instability in their results in case of uncertainty, which often deviate far from optimality. In this work we propose an integrated methodology to measure and analyze the robustness of MOCO problems, and more specifically multi-objective integer programming ones, given the imperfect knowledge of their parameters. We propose measures to assess the robustness of each specific Pareto optimal solution (POS), as well as the robustness of the entire Pareto set (PS) as a whole. The approach builds upon a synergy of Monte Carlo simulation and multi-objective optimization, using the augmented ε-constraint method to generate the exact PS for the MOCO problems under examination. The usability of the proposed framework is justified through the identification of the most robust areas of the Pareto front, and the characterization of every POS with a robustness index. This index indicates a degree of certainty that a specific POS sustains its efficiency. The proposed methodology communicates in an illustrative way the robustness information to managers/decision makers and provides them with an additional supplement/tool to guide and support their final decision. Numerical examples focusing on a multi-objective knapsack problem and an application to academic capital budgeting problem for project selection, are provided to verify the efficacy and added value of the methodology.     

A practical LP model for equity portfolios

A linear programming portfolio selection model is formulated, taking into consideration the objectives and constraints which are imposed on portfolio managers. The composition of portfolios determined by the use of the model are compared to actual portfolios determined by portfolio managers without the use of any quantitative model. The practical use of the model is evaluated and conclusions are reported.     

An Interactive Framework for Multi-Person,Multiobjective Decisions

Group decision making in the presence of multiple conflicting objectives is complex and difficult. This paper describes and evaluates an iterative technique to facilitate multiple objective decision making by multiple decision makers. The proposed method augments an interactive multiobjective optimization procedure with a preference ranking tool and a consensus ranking heuristic. Two multiple objective linear programming (MOLP) solution approaches, the SIMOLP method of Reeves and Franz [39] and the interactive weighted Tchebycheff procedure of Steuer and Choo [49], are recommended optimization strategies to be used independently or in concert. Computational experience suggests that the proposed framework is an effective decision-making tool. The procedure quickly located excellent compromise solutions in a series of test problems with hypothetical decision makers. In addition, human decision makers gave positive evaluations of the procedure and the production plans the procedure provided for a resource allocation case problem.     

改进区间可接受度的证券投资组合区间二次规划模型

本文首先基于Markowitz的经典均值方差模型，针对不确定环境下的投资组合问题，把证券的收益率、风险损失率和流动性用区间数描述，建立了一种新的含交易成本的证券投资组合区间二次规划模型。其次，为求解该模型，提出了改进的区间可接受度确定性转换方法，通过引入优化水平α与可接受水平η将不确定二次规划转化为确定型规划。最后，通过数值实验将提出的方法与传统方法进行比较，结果表明本文所提出的方法与模型具有相对较好的可行性与实用性。     

权重信息未知情况下的多属性群决策方法及其拓展

本文针对群决策中专家权重及指标权重难以确定的问题,提出一种在权重信息完全未知情况下的基于证据距离和模糊熵权变换的多属性群决策方法,其核心在于如何仅通过决策矩阵客观地确定决策者权重及指标权重。通过信息熵和证据距离确定专家权重,并利用模糊变换原理,将专家权重向量与指标熵权矩阵合成,得到统一的群体决策指标权重;最后使用线性加权法集成所有专家对备选方案的评价信息,得到整个方案集的排序。实验结果及相关讨论表明,该方法概念清晰,计算量适中,具有较强的客观性,而且易于机器实现,是一种可行、有效的多属性群决策方法。最后将该方法推广到属性值由精确数、语言值、区间数、直觉模糊数等多种形式构成的混合型多属性群决策中。     

Frontiers of Stochastically Nondominated Portfolios

We consider the problem of constructing a portfolio of finitely many assets whose returns are described by a discrete joint distribution.We propose mean‐risk models that are solvable by linear programming and generate portfolios whose returns are nondominated in the sense of second‐order stochastic dominance. Next, we develop a specialized parametric method for recovering the entire mean‐risk efficient frontiers of these models and we illustrate its operation on a large data set involving thousands of assets and realizations.     

When do Public Managers Imitate Each Other? Mimetic Decision Making in Contracting Decisions of Danish Municipalities

Using organizational new institutional theory, this paper explores a core mechanism underlying contracting decisions in public organizations. A central proposition of this branch of institutional theory is that uncertainty leads to organizational isomorphism. The present study investigates this proposition by asking: When does perceived uncertainty lead public managers to imitative behavior in contracting out decisions? Contrary to most previous studies, we apply an individual level approach and relate different types of perceived uncertainty of decision makers to mimetic decision making. We define mimetic decision making as when decision makers deliberately obtain information about other organizations in order to possibly imitate them. In a survey of Danish municipal managers facing important and complex contracting decisions, we test our hypotheses about three types of perceived uncertainty and mimetic decision making. The results show that technological uncertainty is strongly related to mimetic decision making among public managers. However, we do not find significant results for either volume uncertainty or performance uncertainty. The paper illustrates how uncertainty, through mimetic decision making, is connected to organizational isomorphism. It further highlights that future studies should pay attention to the multidimensionality of uncertainty and its consequences.     

Review of Empirical Studies in Multiobjective Mathematical Programming: Subject Reflection of Nonlinear Utility and Learning

Multiple objective programming provides a means of aiding decision makers facing complex decisions where trade-offs among conflicting objectives must be reconciled. Interactive multiobjective programming provides a means for decision makers to learn what these trade-offs involve, while the mathematical program generates solutions that seek improvement of the implied utility of the decision maker. A variety of multiobjective programming techniques have been presented in the multicriteria decision-making literature. This study reviews published studies with human subjects where some of these techniques were applied. While all of the techniques have the ability to support decision makers under conditions of multiple objectives, a number of features in applying these systems have been tested by these studies. A general evolution of techniques is traced, starting with methods relying upon linear combinations of value, to more recent methods capable of reflecting nonlinear trade-offs of value. Support of nonlinear utility and enhancing decision-maker learning are considered.     

A two-stage stochastic programming approach for identifying optimal postponement strategies in supply chains with uncertain demand

In the course of globalization, applying mass-customization strategies has led to a high diversity of variants in many economic sectors. Thus, customer demands are often less predictable, and handling increasing inventory stocks as well as avoiding shortfalls have become particularly important. All these complexity drivers result in higher supply chain risks. Postponement strategies have been proposed as a suitable approach to address these problems. Although the concept of postponement and its impact on the supply chain are theoretically well discussed, optimally configuring the entire production and distribution activities is still challenging. We present a two-stage stochastic mixed-integer linear programming model, which comprises an integrated production and distribution planning approach, and considers postponement concepts. In comparison to earlier approaches that examine postponement strategies, our model supports the decision maker under demand uncertainty and considers lead times, penalty costs for shortfalls, as well as inventory-keeping decisions over a tactical planning horizon. This allows an integrated investigation of both form and logistics postponement concepts. Moreover, we consider the decision maker’s risk attitude identifying non-dominated profitable and risk-averse strategies. We illustrate the benefits of the model by using a case study from the apparel industry, and present the results of a sensitivity analysis with respect to varying demand uncertainty and demand correlations as well as different preferences regarding risk aversion. Furthermore, we carry out performance and quality benchmarks and compare the results of a standard mixed-integer linear programming solver, a parallel nested Benders approach and a sample average approximation technique.     

Project Portfolio Selection: A Newsvendor Approach

We consider the problem of balancing the penalties associated with budgetary slack (being underbudget) and cost overruns in the project portfolio selection problem by addressing randomness in project costs and making individual project budgets decision variables. Setting the budget for a single project is shown to be analogous to the newsvendor problem. For related versions of the project portfolio selection problem we provide optimal and heuristic procedures. Numerical experiments are used to test the procedures and provide managerial guidelines. We show project budgets should be set so that each project in the portfolio has the same probability of running over budget, it is better to have a larger number of projects with less than ideal funding compared to a smaller number of projects with ideal funding, and substantial opportunities to select more projects with a higher expected profit are available if an aggregate portfolio budget is used.     

PORTFOLIO MODELING IN MULTIPLE-CRITERIA SITUATIONS UNDER UNCERTAINTY

There have been many models for portfolio selection, but most do not explicitly include uncertainty and multiple objectives. This paper presents an approach that includes these aspects using a form of stochastic integer programming with recourse. The method involves the use of a time-based decision tree structure called a “project tree.” Using this basic format, an illustrative six-project example is presented and analyzed. Various forms of objectives are discussed, ranging from the maximization of expected portfolio value to the maximization of the minimum weighted portfolio deviation from two goals. In each case, formulated numerical problems are given, and the solutions derived are presented. The approach is shown to be very flexible and capable of handling a variety of situations and objectives.     

When Costs Are Unequal and Unknown: A Subtree Grafting Approach for Unbalanced Data Classification*

In binary classifications, a decision tree learned from unbalanced data typically creates an important challenge related to the high misclassification rate of the minority class. Assigning different misclassification costs can address this problem, though usually at the cost of accuracy for the majority class. This effect can be particularly hazardous if the costs cannot be specified precisely. When the costs are unknown or difficult to determine, decision makers may prefer a classifier with more balanced accuracy for both classes rather than a standard or cost‐sensitively learned one. In the context of learning trees, this research therefore proposes a new tree induction approach called subtree grafting (STG). On the basis of a real bank data set and several other data sets, we test the proposed STG method and find that our proposed approach provides a successful compromise between standard and cost‐sensitive trees.