نتایج جستجو برای: multiobjective linear programming problem
تعداد نتایج: 1504799 فیلتر نتایج به سال:
The multiple objective simplex algorithm and its variants work in the decision variable space to find set of all efficient extreme points linear programming (MOLP). Other approaches problem either entire solutions or a subset them also return corresponding values (nondominated points). This paper presents an extension multiobjective (MSA) generate nondominated no redundant ones. extended versio...
چکیده ندارد.
چکیده ندارد.
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...
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
Nanoscale crossbar architectures have received steadily growing interests as a result of their great potential to be main building blocks in nanoelectronic circuits. However, due to the extremely small size of nanodevices and the bottom-up self-assembly nanofabrication process, considerable process variation will be an inherent vice for crossbar nanoarchitectures. In this paper, the variation t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید