نتایج جستجو برای: multiple objective programming mop
تعداد نتایج: 1554194 فیلتر نتایج به سال:
Monitoring-Oriented Programming (MOP) is a formal framework for software development and analysis. It aims at reducing the gap between formal specification and implementation via runtime monitoring. In MOP, the developer specifies desired properties using definable specification formalisms, along with code to execute when properties are violated or validated, which can be used not only to repor...
In multiple objective programs [MOP], application functions are established to measure the degree of fulfillment of the decision maker’s requirements (achievement of goals, nearness to an ideal point, satisfaction, etc.) about the objective functions (see e.g. [7, 24]) and are extensively used in the process of finding ”good compromise” solutions. In [6] we demonstrated that the use of interdep...
In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered. To optimize th...
In this paper, we propose and compare singleand multi-objective programming (MOP) approaches to the language model (LM) adaptation that require the optimization of a number of competing objectives. In LM adaptation, an adapted LM is found so that it is as close as possible to two independently trained LMs. The LM adaptation approach developed in this paper is based on reformulating the training...
a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the sam...
a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights that are the most advantages for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the same s...
This note is motivated by the similarity between multiobjective programming (MOP) and bargaining theory. It uses the known MOP concepts to establish two new bargaining results: (1) the efficiency of KalaiSmorodinsky (KS) and Nash (NA) solutions for large classes of bargaining problems can be refined to the sharper concept of proper efficiency; (2) the independence of irrelevant alternatives (II...
a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the sam...
Planning of sewer systems typically involves limitations and problems, regardless whether traditional planning methods or optimization models are used. Such problems include non-quantifiability, fuzzy objectives, uncertainties in decision-making variables which commonly applied the any process. Particularly, have prevented inclusion these models. Consequently, theoretical optional solution math...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید