نتایج جستجو برای: robust possibilistic programming
تعداد نتایج: 525061 فیلتر نتایج به سال:
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics as an extension of description logics. We give semantics and syntax of possibilistic description logics. We then define two inference services in possibilistic description logics. Since possibilistic inference suffers from the drownin...
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility distributions. This paper studies a new representation format, called hybrid possibilistic networks, which cover both standard possibilistic networks and possibilistic knowledge bases. An adaptation of propagation algor...
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
In this work, we define a new framework in order to improve the knowledge representation power of Answer Set Programming paradigm. Our proposal is to use notions from possibility theory to extend the stable model semantics by taking into account a certainty level, expressed in terms of necessity measure, on each rule of a normal logic program. First of all, we introduce possibilistic definite l...
index tracking is the process of developing a portfolio that reproduces the performance of an index. the tracker portfolio has relatively good diversity and low turnover and low transaction costs. in this paper we applied a binary programming model for index tracking problem. in this model the number of assets for portfolio construction is defined by portfolio manager. the robust optimization f...
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
Possibilistic decision theory is a natural one to consider when information about uncertainty cannot be quantified in probabilistic way. Different qualitative criteria based on possibility theory have been proposed, the definition of which requires a finite ordinal, non compensatory, scale for evaluating both utility and plausibility. In presence of heterogeneous information, i.e. when the know...
The objective of the paper is to deal with a kind of possibilistic linear programming (PLP) problem involving multiple objectives of conflicting nature. In particular, we have considered a multi objective linear programming (MOLP) problem whose objective is to simultaneously minimize cost and maximize profit in a supply chain where cost and profit coefficients, and related parameters such as av...
This Thesis raises the question of collective decision making under possibilistic uncertainty. We propose several collective qualitative decision rules and show that in the context of a possibilistic representation of uncertainty, the use of an egalitarian pessimistic collective utility function allows us to get rid of the Timing Effect. Making a step further, we prove that if both the agents’ ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید