首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 10 毫秒
1.
A resource allocation problem is considered with resources that are dependent in the sense that an allocation to an activity requires the application of several resources, except for certain activities which are divisional in the sense that an allocation to such an activity requires the use of only a single resource. Return and cost functions are assumed to be continuous and increasing, and the allocation variables are continuous. Conditions are given for the replacement of the continuous problem by an associated problem with discrete variables and a single constraint, and to a given degree of accuracy. The associated problem can be efficiently solved by dynamic programming. Certain divisional resource allocation problems with discrete variables and several linear constraints are shown to be equivalent to a discrete problem with a single constraint. A numerical example is given.  相似文献   

2.
In many applications of data envelopment analysis (DEA), there is often a fixed cost or input resource which should be imposed on all decision making units (DMUs). Cook and Zhu [W.D. Cook, J. Zhu, Allocation of shared costs among decision making units: A DEA approach, Computers and Operations Research 32 (2005) 2171-2178] propose a practical DEA approach for such allocation problems. In this paper, we prove that when some special constraints are added, Cook and Zhu’s approach probably has no feasible solution. The research of this paper focuses on two main aspects: to obtain a new fixed costs or resources allocation approach by improving Cook and Zhu’s approach, and to set fixed targets according to the amount of fixed resources shared by individual DMUs. When such special constraints are attached, our model is proved to be able to achieve a feasible costs or resources allocation. Numerical results for an example from the literature are presented to illustrate our approach.  相似文献   

3.
In the project management literature, quantitative models were developed for project crashing to determine the appropriate activities for crashing at minimal cost. In this paper, we suggest that the project quality may be affected by project crashing and develop linear programming models to study the tradeoffs among time, cost, and quality. Each of the three models developed optimizes one of these entities by assigning desired bounds on the other two. An illustrative example with a project network consisting of 13 nodes, 14 activities, and 2 dummy activities is provided. The computational study includes tabulation of the interrelationships among time, cost, and quality.  相似文献   

4.
Probabilistic uncertainty is caused by “chance”, whereas strategic uncertainty is caused by an adverse interested party. Using linear impact functions, the problems of allocating a limited resource to defend sites that face either probabilistic risk or strategic risk are formulated as optimization problems that are solved explicitly. The resulting optimal policies differ – under probabilistic risk, the optimal policy is to focus the investment of resources on priority sites where they yield the highest impact, while under strategic risk, the best policy is to spread the resources so as to decrease the potential damage level of the most vulnerable site(s). Neither solution coincides with the commonly practiced proportionality allocation scheme.  相似文献   

5.
In the literature, decision models and techniques for supplier selection do not often consider inventory management of the items being purchased as part of the analysis. In this article, two mixed integer nonlinear programming models are proposed to select the best set of suppliers and determine the proper allocation of order quantities while minimizing the annual ordering, inventory holding, and purchasing costs under suppliers’ capacity and quality constraints. The first model allows independent order quantities for each supplier while the second model restricts all order quantities to be of equal size, as it would be required in a multi-stage (supply chain) inventory model. Illustrative examples are used to highlight the advantages of the proposed models over a previous model introduced in the literature.  相似文献   

6.
This article reports a procedure developed to assist the U.S. Department of Energy in the selection of a portfolio of proposals addressing the design and manufacture of components of solar photovoltaic arrays, and complete photovoltaic systems. Considerations such as the relative importance of the different components in the overall effort, compatibility of the proposed designs, and budgetary and programmatic issues were complicating factors. The technical quality of each proposal was represented by multiple evaluation measures. These were combined into a single index through the use of multi attributeutility function. Indices representing the relative importance of the various components were then developed, and results in measurable value theory were applied to derive an index of technical quality of a portfolio of proposals. The problem was then formulated as an integer program. It was solved by using an interactive branch and bound code that allowed for sensitivity analysis before selecting the portfolio of proposals for funding.The procedure was successfully applied to funding a portfolio of proposals aimed at reducing the cost of producing photovoltaic arrays, and to several other government-sponsored procurements.  相似文献   

7.
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.  相似文献   

8.
Critical path techniques have been in documented use since the mid 1950's and are now widely used in most aspects of project planning and control. Interest in this area in recent years has been mainly concerned with making the best use of scarce resources throughout the duration of a project and a considerable amount of work has been undertaken in this area by both theorists and practitioners in project management. There is still however an apparent gap between the published theoretical work and the requirements of project schedulers and managers in the field and this paper briefly describes the different approaches taken, how they differ and suggests where future effort may be directed.  相似文献   

9.
Maintaining a rich research and development (R&D) pipeline is the key to remaining competitive in many industrial sectors. Due to its nature, R&D activities are subject to multiple sources of uncertainty, the modeling of which is compounded by the ability of the decision maker to alter the underlying process. In this paper, we present a multi-stage stochastic programming framework for R&D pipeline management, which demonstrates how essential considerations can be modeled in an efficient manner including: (i) the selection and scheduling of R&D tasks with general precedence constraints under pass/fail uncertainty, and (ii) resource planning decisions (expansion/contraction and outsourcing) for multiple resource types. Furthermore, we study interdependencies between tasks in terms of probability of success, resource usage and market impact. Finally, we explore risk management approaches, including novel formulations for value at risk and conditional value at risk.  相似文献   

10.
We consider the situation when a scarce renewable resource should be periodically distributed between different users by a Resource Management Authority (RMA). The replenishment of this resource as well as users demand is subject to considerable uncertainty. We develop cost optimization and risk management models that can assist the RMA in its decision about striking the balance between the level of target delivery to the users and the level of risk that this delivery will not be met. These models are based on utilization and further development of the general methodology of stochastic programming for scenario optimization, taking into account appropriate risk management approaches. By a scenario optimization model we obtain a target barycentric value with respect to selected decision variables. A successive reoptimization of deterministic model for the worst case scenarios allows the reduction of the risk of negative consequences derived from unmet resources demand. Our reference case study is the distribution of scarce water resources. We show results of some numerical experiments in real physical systems.  相似文献   

11.
Optimal asset allocation well-fitting investors’ goals is a pressing challenge in risk management. Making a step forward to the Sharpe ratio, the parameter-dependent Sortino–Satchell, Generalized Rachev and Farinelli–Tibiletti performance ratios are suggested for personalizing asset allocation. Tailor-made optimal asset paths for five different investor risk profiles are traced over a rolling 12 month investing horizon. Our simulations show a satisfactorily good match between asset allocation and correspondent risk profile. Specifically, Generalized Rachev ratios outperform in personalized allocation for “extreme” risk profiles, i.e. conservative and aggressive investors, whereas Sortino–Satchell and Farinelli–Tibiletti ratios for those that are more moderate. Sharpe ratio confirms its ability in constructing steady-diversified portfolios, although underperformed.  相似文献   

12.
Data Envelopment Analysis (DEA) is a technique based on mathematical programming for evaluating the efficiency of homogeneous Decision Making Units (DMUs). In this technique inefficient DMUs are projected on to the frontier which constructed by the best performers. Centralized Resource Allocation (CRA) is a method in which all DMUs are projected on to the efficient frontier through solving just one DEA model. The intent of this paper is to present the Stochastic Centralized Resource Allocation (SCRA) in order to allocate centralized resources where inputs and outputs are stochastic. The concept discussed throughout this paper is illustrated using the aforementioned example.  相似文献   

13.
A leading manufacturer of forest products with several production facilities located in geographical proximity to each other has recently acquired a number of new production plants in other regions/countries to increase its production capacity and expand its national and international markets. With the addition of this new capacity, the company wanted to know how to best allocate customer orders to its various mills to minimize the total cost of production and transportation. We developed mixed-integer programming models to jointly optimize production allocation and transportation of customer orders on a weekly basis. The models were run with real order files and the test results indicated the potential for significant cost savings over the company’s current practices. The company further customized the models, integrated them into their IT system and implemented them successfully. Besides the actual cost savings for the company, the whole process from the initial step of analyzing the problem, to developing, testing, customizing, integrating and finally implementing the models provided enhanced intelligence to sales staff.  相似文献   

14.
In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature.  相似文献   

15.
This article describes a fast, easily implemented MILP algorithm which selects optimal boolean factors (called keys) for predicting the outcomes of Presidential elections in the United States. Results derived from the method support the validity and parsimony of the key-based election model offered by Lichtman and Keilis-Borok.  相似文献   

16.
We develop a multi-objective model for the time–cost trade-off problem in a dynamic PERT network using an interactive approach. The activity durations are exponentially distributed random variables and the new projects are generated according to a renewal process and share the same facilities. Thus, these projects cannot be analyzed independently. This dynamic PERT network is represented as a network of queues, where the service times represent the durations of the corresponding activities and the arrival stream to each node follows a renewal process. At the first stage, we transform the dynamic PERT network into a proper stochastic network and then compute the project completion time distribution by constructing a continuous-time Markov chain. At the second stage, the time–cost trade-off problem is formulated as a multi-objective optimal control problem that involves four conflicting objective functions. Then, the STEM method is used to solve a discrete-time approximation of the original problem. Finally, the proposed methodology is extended to the generalized Erlang activity durations.  相似文献   

17.
This paper introduces a risk-based optimization method to schedule projects. The method uses risk mitigation and optimal control techniques to minimize variables such as the project duration or the cost estimate at completion. Mitigation actions reduce the risk impacts that may affect the system. A model predictive control approach is used to determine the set of mitigation actions to be executed and the time in which they are taken. A real-life project in the field of semiconductor manufacturing has been taken as an example to show the benefits of the method in a deterministic case and a Monte Carlo simulation has also been carried out.  相似文献   

18.
Recent extreme economic developments nearing a worst-case scenario motivate further examination of minimax linear programming approaches for portfolio optimization. Risk measured as the worst-case return is employed and a portfolio from maximizing returns subject to a risk threshold is constructed. Minimax model properties are developed and parametric analysis of the risk threshold connects this model to expected value along a continuum, revealing an efficient frontier segmenting investors by risk preference. Divergence of minimax model results from expected value is quantified and a set of possible prior distributions expressing a degree of Knightian uncertainty corresponding to risk preference determined. The minimax model will maximize return with respect to one of these prior distributions providing valuable insight regarding an investor’s risk attitude and decision behavior. Linear programming models for financial firms to assist individual investors to hedge against losses by buying insurance and a model for designing variable annuities are proposed.  相似文献   

19.
A standard quadratic optimization problem (StQP) consists in minimizing a quadratic form over a simplex. Among the problems which can be transformed into a StQP are the general quadratic problem over a polytope, and the maximum clique problem in a graph. In this paper we present several new polynomial-time bounds for StQP ranging from very simple and cheap ones to more complex and tight constructions. The main tools employed in the conception and analysis of most bounds are Semidefinite Programming and decomposition of the objective function into a sum of two quadratic functions, each of which is easy to minimize. We provide a complete diagram of the dominance, incomparability, or equivalence relations among the bounds proposed in this and in previous works. In particular, we show that one of our new bounds dominates all the others. Furthermore, a specialization of such bound dominates Schrijver’s improvement of Lovász’s θ function bound for the maximum size of a clique in a graph.   相似文献   

20.
Convergence speed and diversity of nondominated solutions are two important performance indicators for Multi-Objective Evolutionary Algorithms (MOEAs). In this paper, we propose a Resource Allocation (RA) model based on Game Theory to accelerate the convergence speed of MOEAs, and a novel Double-Sphere Crowding Distance (DSCD) measure to improve the diversity of nondominated solutions. The mechanism of RA model is that the individuals in each group cooperate with each other to get maximum benefits for their group, and then individuals in the same group compete for private interests. The DSCD measure uses hyper-spheres consisting of nearest neighbors to estimate the crowding degree. Experimental results on convergence speed and diversity of nondominated solutions for benchmark problems and a real-world problem show the efficiency of these two proposed techniques.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号