Search

In the context of project management, the attention given to project portfolio management has increased in recent years. The use of mathematical programming for portfolio management is also on the rise, because it integrates the project interactions with the multiple objectives of portfolio management into a single model. Among the possible objectives, recent studies have paid special attention to the emerging objective of future preparedness, which has not yet been incorporated into the existing mathematical models. This paper presents a mixed-integer nonlinear optimization model for portfolio selection that considers four main performance measures for project management, namely, value maximization, strategic alignment, balance, and future preparedness. Given the importance of the last measure, the purpose of this paper is to provide a more complete model that provides the marginal contribution and the best combination of projects according to the needs of the company. The model is tested using real data from two companies, one in Brazil and one in Canada, and the results obtained are coherent with their respective practices. [ABSTRACT FROM AUTHOR]

In today's business world, oil companies cannot be productive and competitive, and thus, will not survive without taking the supply chain management concepts into account. Consequently, the management of a crude oil supply chain (COSC) is increasingly receiving substantial importance. The growing number of papers and books on this topic is a further witness of this fact. To foster insight into issues intertwined with COSC problems, this paper is devoted to an extensive review of mathematical programming models in this context. The classification approach for this review is based on a taxonomy framework. In this framework, ongoing and emerging challenges surrounding the strategic and tactical decisions of COSC problems are investigated. As a main goal, the gaps of literature are analyzed to recommend possible research directions. [ABSTRACT FROM AUTHOR]

Triangular fuzzy reciprocal preference relations (TFRPRs) are good choices to denote the decision makers' fuzzy preferences. Consistency analysis is a very important topic to preference relations that can avoid the illogical ranking order. However, all previous multiplicative consistency concepts for TFRPRs cannot well address this type of preference relations. To address this issue, this paper introduces a new multiplicative consistency concept for TFRPRs, which can be seen as a natural extension of Tanino's multiplicative consistency concept for reciprocal preference relations. Based on the new consistency concept, 0–1 mixed programming models for judging the multiplicative consistency of TFRPRs are constructed, and an approach for deriving multiplicative consistent TFRPRs is provided. Considering the incomplete case, programming models to determine missing values are constructed. Subsequently, a multiplicative consistency based method for decision making with TFRPRs is presented that can address the inconsistent and incomplete cases. Meanwhile, illustrative examples are provided to show the concrete application of the proposed procedure, and comparison analysis is also made. [ABSTRACT FROM AUTHOR]

A multi-depot Chinese postman problem (MDCP) arises from a network (e.g. cityplan) in which several depots are located wherefrom edges (e.g. streets) have to be served. Since costs are involved with each visit to an edge, the objective is to find a minimum cost tour in the network that visits all edges of the network. Such a minimum cost tour consists of a collection of subtours such that the subtours originate from different depots, and each subtour starts and ends at the same depot. This typical OR problem turns into a multi decision maker problem if agents are assigned to the streets. In this new setting the cost of a minimum cost tour that visits all edges have to be paid by the agents. However, now each group of agents (coalition) has the opportunity to find its own minimum cost tour, i.e. a minimum cost tour that only visits the edges owned by the group of agents. Therefore, the main objective is to find allocations of the cost of a minimum tour that visits all agents in such a way that no coalition has higher costs than the costs incurred by its own minimum tour. We will use cooperative game theory to investigate whether these so-called core allocations exist. Therefore, we consider a cooperative Chinese postman (CP) game that is induced by an MDCP by associating every edge of the network with a different agent. In this paper, we characterize classes of networks that ensure the existence of core allocations, the so-called CP balanced graphs, and the existence of specific core allocations, the so-called CP submodular graphs. [ABSTRACT FROM AUTHOR]

This paper focuses on a multidemand multisource order quantity allocation problem with multiple transportation alternatives. To solve this problem, a bilevel multiobjective programming model under a mixed uncertain environment is proposed. Two levels of decision makers are considered in the model. On the upper level, the purchaser aims to allocate order quantity to multiple suppliers for each demand node with the consideration of three objectives: total purchase cost minimization, total delay risk minimization, and total defect risk minimization. On the lower level, each supplier attempts to optimize the transportation alternatives with total transportation and penalty costs minimization as the objective. In contrast to prior studies, considering the information asymmetry in the bilevel decision, random and fuzzy random variables are used to model uncertain parameters of the construction company and the suppliers. To solve the bilevel model, a solution method based on Kuhn-Tucker conditions, sectional genetic algorithm, and fuzzy random simulation is proposed. Finally, the applicability of the proposed model and algorithm is evaluated through a practical case from a large scale construction project. The results show that the proposed model and algorithm are efficient in dealing with practical order quantity allocation problems. [ABSTRACT FROM AUTHOR]

Abstract: The optimal placement of turbines in a wind farm is critical to the maximization of power production. In this paper, we develop a new mathematical programming approach for wind farm layout optimization. We use Jensen's wake decay model to represent multi-turbine wake effects. We develop mixed integer linear and quadratic optimization formulations and apply them to several example layout cases in the literature. Compared to previous approaches, our models produce layouts that tend to be more symmetric and that generate slightly more power. Our formulations solve quickly, allowing a decision maker to efficiently explore the impact of different turbine densities in a wind farm. [Copyright &y& Elsevier]

Abstract: This paper deals with a minimum spanning tree problem where each edge cost includes uncertainty and importance measure. In risk management to avoid adverse impacts derived from uncertainty, a d-confidence interval for the total cost derived from robustness is introduced. Then, by maximizing the considerable region as well as minimizing the cost-importance ratio, a biobjective minimum spanning tree problem is proposed. Furthermore, in order to satisfy the objects of the decision maker and to solve the proposed model in mathematical programming, fuzzy goals for the objects are introduced as satisfaction functions, and an exact solution algorithm is developed using interactive decision making and deterministic equivalent transformations. Numerical examples are provided to compare our proposed model with some previous models. [Copyright &y& Elsevier]

Abstract: Goal programming as a well known technique has been widely used for solving multi objective decision making problems. However, in some practical cases, there may exist situations where the decision maker is interested in setting multi aspiration levels for objectives that may not be expressed in a precise manner. In this paper, a novel formulation of fuzzy multi-choice goal programming (FMCGP) is presented. The proposed approach not only improves the applicability of goal programming in real world situations but also provides useful insight about the solution of a new class of problems. To illustrate and clarify the proposed approach, a numerical example is presented. [Copyright &y& Elsevier]

Abstract: In this paper, assuming cooperative behavior of the decision makers, solution methods for decision making problems in hierarchical organizations under fuzzy random environments are considered. To deal with the formulated two-level linear programming problems involving fuzzy random variables, -level sets of fuzzy random variables are introduced and an -stochastic two-level linear programming problem is defined for guaranteeing the degree of realization of the problem. Taking into account the vagueness of judgments of decision makers, fuzzy goals are introduced and the -stochastic two-level linear programming problem is transformed into the problem to maximize the satisfaction degree for each fuzzy goal. Through the use of the fractile criterion optimization model, the transformed stochastic two-level programming problem can be reduced to a deterministic one. Interactive fuzzy programming to obtain a satisfactory solution for the decision maker at the upper level in consideration of the cooperative relation between decision makers is presented. It is shown that all of the problems to be solved in the proposed interactive fuzzy programming can be easily solved by the simplex method, the sequential quadratic programming or the combined use of the bisection method and the sequential quadratic programming. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method. [Copyright &y& Elsevier]

Abstract: Risk management is an inherent part of supplier selection. While companies are enjoying the benefits of outsourcing, risks brought by this practice should be taken into account in the process of decision making. This paper presents a multiobjective stochastic sequential supplier allocation model to help in supplier selection under uncertainty. Demand for products, capacities at suppliers as well as transportation and other variable costs are the main sources of uncertainty and are modeled using probability distributions. Disruptions are exogenous events and the model provides proactive mitigation strategies against disruptions by assigning backup suppliers who can be used in case of a default at a primary supplier. When there is no disruption, the model’s solution is an optimal supplier order assignment, considering operational risks. [Copyright &y& Elsevier]

Abstract: Two-stage DEA (data envelopment analysis) models show the performance of individual processes, and thus are more informative than the conventional one-stage models for making decisions. This paper extends this approach from deterministic to uncertain situations, where the observations are represented by fuzzy numbers. The extension principle is utilized to develop a pair of two-level mathematical programs to calculate the lower and upper bounds of the -cut of the fuzzy efficiency. By enumerating various values of , the membership functions of fuzzy efficiencies are constructed numerically. It is found that the property of the system efficiency being equal to the product of the two process efficiencies, which holds for the deterministic case, also holds for the fuzzy case. This property can be generalized to series systems with more than two processes. An example of non-life insurance companies in Taiwan is used to explain how to calculate the system and process efficiencies and how to derive their relationship when the data is fuzzy. [Copyright &y& Elsevier]

This paper provides a methodology to assist a strategic producer in making informed decisions on generation investment. A single target year is considered with demand variations modeled through blocks. The strategic behavior of the producer is represented through a bilevel model: the upper-level considers both investment decisions and strategic production actions and the lower-level corresponds to market clearing. Prices are obtained as dual variables of power balance equations. Rival uncertainties (on offering and investment) are characterized through scenarios. The resulting model is a large-scale mixed-integer LP problem solvable using currently available branch-and-cut techniques. Results pertaining to an illustrative example and a case study are reported and discussed. [ABSTRACT FROM PUBLISHER]

Summary: This paper provides an empirical test of whether the Asian Development Bank (ADB) adjusts allocation decisions about environmentally risky projects to reflect borrower environmental performance in previous projects. This type of performance-based decision-making has been repeatedly highlighted as key to achieving favorable development assistance outcomes in a variety of programming areas. I collect recipient environmental performance information from all available post-project evaluations since 1990 and create an indicator of environmental reputation using a Bayesian updating model. I use this environmental reputation indicator to demonstrate that the ADB responds to previous borrower environmental performance when approving environmentally risky projects, but that past environmental performance does not positively influence the allocation of projects with no environmental risks. These results demonstrate that performance-based allocation decisions are possible for development organizations within specific programmatic areas when low performance is a significant risk to the core functions of the organization, which in this case is the ability to approve and disburse lending projects. [ABSTRACT FROM AUTHOR]

Abstract: In this paper a systematic methodology is presented for the simultaneous optimal selection of raw materials, fossil fuels and alternative fuels in cement production. The aim is to offer a generic mathematical formulation that can be used as the basis for developing case specific mathematical formulations that can assist the strategic decision-making process. The mathematical model presented takes into consideration the essential elements of a cement plant operation. The final formulation is a mixed integer linear programming problem that aims at minimizing the overall operating cost. A realistic case study is presented which demonstrates the usefulness of the proposed mathematical programming methodology. [Copyright &y& Elsevier]

Numerous analytical methods ranging from simple weighted scoring to complex mathematical programming approaches have been proposed to solve supplier selection and order allocation problems. However, the traditional methods too often fail to consider: (1) situations in which goods are transported from a supplier to a receiver using different transportation alternatives (TAs) and (2) a finite planning horizon consisting of multiple discrete time periods. We present a structured framework with two separate but dependent phases. In the selection phase, we use a data envelopment analysis model to determine the relative efficiency of the suppliers and the TAs. In the allocation phase, we use a multi-objective mixed integer programming model with two objectives for minimizing the total costs and maximizing the overall efficiencies. The contribution of this paper is threefold: (1) It provides a comprehensive and systematic framework that embraces both quantitative and qualitative criteria; (2) it addresses the need in the supplier evaluation literature for methods that considers different TAs in the supplier selection and order allocation decisions encompassing multiple discrete time periods; and (3) it uses a real-world case study to demonstrate the applicability of the proposed framework and exhibit the efficacy of the procedures and algorithms. [ABSTRACT FROM AUTHOR]

Abstract: Data envelopment analysis (DEA) and multiple objective linear programming (MOLP) can be used as tools in management control and planning. The existing models have been established during the investigation of the relations between the output-oriented dual DEA model and the minimax reference point formulations, namely the super-ideal point model, the ideal point model and the shortest distance model. Through these models, the decision makers’ preferences are considered by interactive trade-off analysis procedures in multiple objective linear programming. These models only consider the output-oriented dual DEA model, which is a radial model that focuses more on output increase. In this paper, we improve those models to obtain models that address both inputs and outputs. Our main aim is to decrease total input consumption and increase total output production which results in solving one mathematical programming model instead of n models. Numerical illustration is provided to show some advantages of our method over the previous methods. [ABSTRACT FROM AUTHOR]

While data envelopment analysis (DEA) models are very sensitive to possible data errors, in many real applications, the data of production processes cannot be precisely measured. Fuzzy DEA is asuccessful method that allows to deal with imprecise data in DEA. In this paper, we develop fuzzy version of the input relaxation model introduced in Jahahshahloo and Khodabakhshi [15] by using some ranking methods based on the comparison of α-cuts. The resulting auxiliary crisp problems can be solved by the usual DEA software. It is shown that, using a numerical example, how the proposed model become specially useful for detecting sensitive decision-making units. [ABSTRACT FROM AUTHOR]

Abstract: Alirezaee and Afsharian have proposed a new index, namely, Balance Index, to rank DMUs. In this paper, we will use their examples to illustrate that the proposed index is not stable. As a result, the corresponding rankings are also unstable. Then we analyze where an error occurs in the new method for complete ranking of decision making units and amend it by introducing the Maximal Balance Index. The numeral example reports the reasonability of our methods. [ABSTRACT FROM AUTHOR]

This paper presents a fuzzy goal programming (FGP) procedure for solving bilevel multiobjective linear fractional programming (BL-MOLFP) problems. It makes an extension work of Moitra and Pal (2002) and Pal et al. (2003). In the proposed procedure, the membership functions for the defined fuzzy goals of the decision makers (DMs) objective functions at both levels as well as the membership functions for vector of fuzzy goals of the decision variables controlled by first-level decision maker are developed first in the model formulation of the problem. Then a fuzzy goal programming model to minimize the group regret of degree of satisfactions of both the decision makers is developed to achieve the highest degree (unity) of each of the defined membership function goals to the extent possible by minimizing their deviational variables and thereby obtaining the most satisfactory solution for both decision makers. The method of variable change on the under- and over-deviational variables of the membership goals associated with the fuzzy goals of the model is introduced to solve the problem efficiently by using linear goal programming (LGP) methodology. Illustrative numerical example is given to demonstrate the procedure. [ABSTRACT FROM AUTHOR]

This paper is concerned with the optimal constrained pruning of decision trees. We present a novel 0-1 programming model for pruning the tree to minimize some general penalty function based on the resulting leaf nodes, and show that this model possesses a totally unimodular structure that enables it to be solved as a shortest-path problem on an acyclic graph. Moreover, we prove that this problem can be solved in strongly polynomial time while incorporating an additional constraint on the number of residual leaf nodes. Furthermore, the framework of the proposed modeling approach renders it suitable to accommodate different (multiple) objective functions and side-constraints, and we identify various such modeling options that can be applied in practice. The developed methodology is illustrated using a numerical example to provide insights, and some computational results are presented to demonstrate the efficacy of solving generically constrained problems of this type. We also apply this technique to a large-scale transportation analysis and simulation system (TRANSIMS), and present related computational results using real data to exhibit the flexibility and effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]