به دلیل عدم قطعیت‌های شناختی، تصادفی و محدودیت‌های انعطاف پذیر، در این مطالعه مدل جدیدی از برنامه‌ریزی محدودیت شانس انعطاف‌پذیر، امکانی، استوار مختلط بر مبنای تئوری اعتبار برای طراحی شبکه زنجیره تامین حلقه بسته توسعه داده شد. نگرش‌های متفاوت تصمیم‌گیرندگان با اندازه‌گیری انعطاف‌پذیرتر پارامترهای خوش‌بینانه بدبینانه قالب معیار پاسخ حداقل سطح رضایت انعطاف‌پذیر حل بهینه گردید. پیشنهادی، قادر کاهش ...

Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the curre...

Portfolio selection is an important issue for researchers and practitioners. Compared with the conventional probabilistic mean-variance method, fuzzy number can better describe an uncertain environment with vagueness and ambiguity. In this paper, the portfolio selection model with transaction costs and lending is proposed by means of possibilistic mean and possibilistic variance under the assum...

This paper continues the authors’ research in stability analysis in possibilistic programming in that it extends the results in [7] to possibilistic linear programs with multiple objective functions. Namely, we show that multiobjective possibilistic linear programs with continuous fuzzy number coefficients are well-posed, i.e. small changes in the membership function of the coefficients may cau...

Recent research has identified the notion of indirect consistency as a rationality postulate that every rule-based argumentation frameworks should satisfy. Possibilistic Defeasible Logic Programming (PDeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at objectlanguage level, in which indirect consistency does not hold. In ...

12 Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from 13 argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-lan14 guage level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot 15 be expressed in the object la...