نتایج جستجو برای: robust possibilistic programming

تعداد نتایج: 525061  

2016
Maryam Rahafrooz Mahdi Alinaghian

Article history: Received November 4 2015 Received in Revised Format December 21 2015 Accepted February 25 2016 Available online February 25 2016 In this paper, a novel multi-objective robust possibilistic programming model is proposed, which simultaneously considers maximizing the distributive justice in relief distribution, minimizing the risk of relief distribution, and minimizing the total ...

Portfolio selection problem is one of the most important problems in finance. This problem tries to determine the optimal investment allocation such that the investment return be maximized and investment risk be minimized. Many risk measures have been developed in the literature until now; however, Conditional Drawdown at Risk is the newest one, which is a conditional risk value type problem. T...

Journal: :Artif. Intell. Research 2013
Masatoshi Sakawa Takeshi Matsui Hideki Katagiri

This paper considers multiobjective linear programming problems where each coefficient of the objective functions is expressed by a random fuzzy variable. A new decision making model is proposed by incorporating the concept of fractile criteria optimization into a possibilistic programming model. An interactive fuzzy satisficing method is presented for deriving a satisficing solution for a deci...

2010
Kim Bauters Steven Schockaert Jeroen Janssen Dirk Vermeir Martine De Cock

Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information. To cope with this, we propose an extension of FASP based on possibility theory. The resulting fr...

2011
Keivan Shariatmadar Erik Quaeghebeur Gert de Cooman

Consider the following (standard) linear programming problem: maximise a real-valued linear function CT x defined for optimisation variables x in Rn that have to satisfy the constraints Ax ≤ B, x ≥ 0, where the matrices A, B, and C are independent random variables that take values a, b, and c in Rm×n, Rm and Rn, respectively. Using an approach we developed in previous work [3], the problem is f...

Journal: :Int. J. Approx. Reasoning 1998
Régis Sabbadin Hélène Fargier Jérôme Lang

We extend Dubois and Prade's possibilistic decision theory to multi-stage decision making. EEects of actions are described by possibility distributions; objectives are speciied either by a partition of the nal states between goal and non-goal states, or more generally by a qualitative utility function. Optimal policies are computed by an algorithm in the style of dynamic programming.

Lean manufacturing is a strategic concern for companies which conduct mass production and it has become even more significant for those producing in a project-oriented way by modularization.  In this paper, a bi-objective optimization model is proposed to design and plan a supply chain up to the final assembly centre. The delivery time and the quality in the procurement and low fluctuation of t...

This paper proposes a bi-objective reliable supply chain network design that immunizes the network against different sources of uncertainties. In this regard, scenario based stochastic programming method is applied to model different disruption scenarios affecting accurate performance of network stages. Also, reliable and unreliable facilities are suggested for lessening vulnerability of networ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید