Book report (Fuzzy random variable, MST, possibilistic programming)

Source: Internet
Author: User

Book report on "Fuzzy random minimum spanning tree problems through possibilistic programming and the expectation Optimiza tion Model "

Part1:theoretical basis

1.Fuzzy random variable 2.MST, Minimal Ratio Spanning Tree 3.Possibilistic programming 4.Expectation optimization Mo Del

1.Fuzzy random variable

Definition and Usage:fuzzy random variables generalize random variables, random vectors and random sets. The expected value of a fuzzy variable is a natural generalization of the integral of a set-valued function (Refer to Mada  n [1]). In short, the usage of the fuzzy random variables are to simulate human decision or natural.

2.MST, Minimal Ratio Spanning Tree

Basic Algorithm:kruskal, Prim, Dinkelbach, bisection algorithm

New Learning Algorithm:dinkelbach ' s Method

Introduction of Dinkelbach ' s Method:

This algorithm can solve the problems like find some point x0 which satisfies

                              

This problem can convert to another form:

This problem can is solved with simple bisection algorithm. But Dinkelbach algorithm can solve this problem in O (log (NM)). This algorithm can is easily understood from graph.

As shown in the graph, we had to findθ0 this satisfied Z (θ0) = 0, we tryθ ' first, and we find Z (θ ') > 0, and then, We can then assign next pointθ=. This is much quicker than bisection algorithm. Besides, in MEGIDDO [2], so paper prove that the problem like (if problem like (can be solvable within o[p (n)] Compa Risons and O[q (n)] additions, then B was solvable in time O[p (n) (q (N) + p (n))].

3.Possibilistic programming (Haven ' t finished yet)

4.Expectation optimization Model (Haven ' t finished yet)

Part2:the understanding of this thesis

Question 1:what?

In this paper, the they deal with minimum spanning the tree problems where each edge weight is a fuzzy random variable. After transform this problem into a and simple one, the problem to be solved is a minimum ratio spanning tree problem.

Question 2:how?

Fuzzy random variable, possibilistic programming, expectation optimization Model, Prim algorithm, Dinkelbach algorithm.

Question 3:why better?

In this paper, the author just put forward a new-to solve the realistic problem. The algorithm he based on existing algorithm. So, I would like to say that the author are creative and good at knowledge application.

Part3:unsolved problem

    1. The exact implementation of the Fuzzy Random Variable.
    2. The possibility programming and the expectation optimization Model which is used in conversion process of interphase.

Book report (Fuzzy random variable, MST, possibilistic programming)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.