Download Credibilistic Programming: An Introduction to Models and by Xiang Li PDF

By Xiang Li

It presents fuzzy programming method of resolve real-life choice difficulties in fuzzy surroundings. in the framework of credibility idea, it offers a self-contained, complete and up to date presentation of fuzzy programming types, algorithms and functions in portfolio research.

Show description

Read Online or Download Credibilistic Programming: An Introduction to Models and Applications (Uncertainty and Operations Research) PDF

Similar algorithms books

Genetic Algorithms for Machine Learning

The articles provided right here have been chosen from initial models offered on the overseas convention on Genetic Algorithms in June 1991, in addition to at a unique Workshop on Genetic Algorithms for computer studying on the comparable convention. Genetic algorithms are general-purpose seek algorithms that use rules encouraged by means of usual inhabitants genetics to adapt recommendations to difficulties.

Reconfigurable Computing: Architectures, Tools, and Applications: 10th International Symposium, ARC 2014, Vilamoura, Portugal, April 14-16, 2014. Proceedings

This ebook constitutes the completely refereed convention court cases of the tenth overseas Symposium on Reconfigurable Computing: Architectures, instruments and purposes, ARC 2014, held in Vilamoura, Portugal, in April 2014. The sixteen revised complete papers provided including 17 brief papers and six precise consultation papers have been rigorously reviewed and chosen from fifty seven submissions.

Computability theory

What do we compute--even with limitless assets? Is every thing close by? Or are computations unavoidably enormously restricted, not only in perform, yet theoretically? those questions are on the center of computability thought. The objective of this publication is to offer the reader an organization grounding within the basics of computability conception and an outline of at the moment lively components of study, comparable to opposite arithmetic and algorithmic randomness.

Structure-Preserving Algorithms for Oscillatory Differential Equations II

This publication describes various powerful and effective structure-preserving algorithms for second-order oscillatory differential equations. Such platforms come up in lots of branches of technology and engineering, and the examples within the booklet comprise platforms from quantum physics, celestial mechanics and electronics.

Extra resources for Credibilistic Programming: An Introduction to Models and Applications (Uncertainty and Operations Research)

Example text

Fm , fuzzy variables f1 (ξ1 ), f2 (ξ2 ), . . , fm (ξm ) are also independent. Proof For any (x1 , x2 , . . 17, we have Cr f1 (ξ1 ) = x1 , f2 (ξ2 ) = x2 , . . , fm (ξm ) = xm = Cr ξ1 ∈ f1−1 (x1 ), ξ2 ∈ f2−1 (x2 ), . . , ξm ∈ fm−1 (xm ) = min Cr ξi ∈ fi−1 (xi ) 1≤i≤m = min Cr fi (ξi ) = xi . 1≤i≤m Thus f1 (ξ1 ), f2 (ξ2 ), . . , fm (ξm ) are independent. The proof is complete. 20 If fuzzy variables ξ and η are independent, then it follows from above theorem that fuzzy variables ξ 2 and (η + 1)3 are also independent.

Therefore, we need to define a credibilistic mapping from the collection of fuzzy variables to the set of real numbers, such that we can rank fuzzy variables according to the natural ordership of real numbers. 9), if the credibilistic mappings U, U1 , U2 , . . t. Ui gi (x, ξ ) ≤ 0, i = 1, 2, . . , n. 11) is a crisp nonlinear programming model since the objective function and constraints are both well defined. In what follows, we will call it a credibilistic programming model. 2 Credibilistic Programming 37 credibilistic mappings including the expected value operator, optimistic value, pessimistic value, entropy, cross-entropy, and distance.

5, 0, if x ∈ {−1, 1} otherwise. 15 Fuzzy variables ξ1 , ξ2 , . . , ξm are said to be identically distributed if and only if each pair of them are identically distributed. 27 Suppose that ξi = (a, b, c), i = 1, 2, . . , m are independent and identically distributed triangular fuzzy variables. For any positive numbers x1 , x2 , . . , xm with x1 + x2 + · · · + xm = 1, we have ξ1 x1 + ξ2 x2 + · · · + ξm xm = (a, b, c). That is, the weighted sum is identically distributed with each element. The conclusion still holds if the triangular fuzzy variables are changed to be equipossible fuzzy variables, trapezoidal fuzzy variables, normal fuzzy variables, or exponential fuzzy variables.

Download PDF sample

Rated 4.25 of 5 – based on 8 votes