نتایج جستجو برای: multiple objective linear programmingmolp
تعداد نتایج: 1685487 فیلتر نتایج به سال:
multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...
recently, lotfi et al. [10] established an equivalence model between the output-oriented dual ccr model and multiple objective linear programming (molp) and used an interactive method for finding target unit on efficiency frontier such that the decision maker preferences can be taken into account. however their method is not applicable for situations in which some outputs are undesirable and ne...
in this paper imprecise target models has been proposed to investigate the relation between imprecise data envelopment analysis (idea) and mini-max reference point formulations. through these models, the decision makers' preferences are involved in interactive trade-off analysis procedures in multiple objective linear programming with imprecise data. in addition, the gradient projection type me...
data envelopment analysis (dea) is a technique used to evaluate the relative efficiency of comparable decision making units (dmus) with multiple input-output. it computes a scalar measure of efficiency and discriminates between efficient and inefficient dmus. it can also provide reference units for inefficient dmus without consideration of the decision makers’ (dms) preferences. in this paper, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید