In solving a decision tree problem, calculations start at the ends of the "branches" of the tree and work backwards to the base "trunk" of the tree. Group of answer choices True False

Question

Karissa Espinoza

Business

17 August, 04:04

In solving a decision tree problem, calculations start at the ends of the "branches" of the tree and work backwards to the base "trunk" of the tree. Group of answer choices True False

+4

Answers (1)

Know the Answer?

Bridger Lam · Answer 1

True

Explanation:

Solving a decision tree (also known as folding back the decision)

To do this, the end branches are first calculated then to the previous branch and so on toll it gets to the base trunk of the tree ...

The interpretation of this is that, we start on the right hand side of the decision tree, and work back towards the left.

As this is being completed, a set of calculations on a node (decision square or uncertainty circle), all you need to do is to record the result.

All calculations that lead to that result from then on can then be ignored.