| Course | BUS 660 Quantitative Methods |
|---|---|
| Topic | Topic 2 |
| Paper type | Decision tree analysis |
| Length | About 1,050 words, 2 pages |
| Format | APA 7 student paper |
| School | Grand Canyon University (GCU) |
| Program | MBA |
| Updated | October 2026 |
Free sample paper for BUS 660 Topic 2
Test First, Then Decide: A Decision Tree for a Bakery's Gluten-Free Line, Rolled Back With Every Calculation Shown
[Author Name]
Colangelo College of Business, Grand Canyon University
BUS-660: Quantitative Methods
Topic 2 Decision Tree Analysis
[Instructor Name]
[Date]
The organization, setting and figures below are a composite written as a model document. No real employer, client, colleague or patient is described.
Test First, Then Decide: A Decision Tree for a Bakery's Gluten-Free Line, Rolled Back With Every Calculation Shown
Why This Problem Needs a Tree
A composite regional bakery is considering a new gluten-free bread line. It can launch now, decline, or first commission a market test in a few stores for 20,000 dollars and then decide. The problem genuinely needs a decision tree, because a later choice, whether to launch, depends on how an earlier uncertainty, the test result, resolves (Render et al., 2018). A payoff table cannot show that sequence. Amounts shown are illustrative and stated in thousands.
The Inputs
If launched, the line will either succeed, earning 300 over three years, or fail, losing 150 in equipment, marketing and spoiled stock. The bakery's product team judges success and failure equally likely before any test, based on the results of three earlier product launches. The test is informative but imperfect: if the line would succeed, the test shows a favorable result 80 percent of the time; if it would fail, the test still shows a favorable result 30 percent of the time.
Structure
The tree begins with a decision node, drawn as a square: test or do not test. Choosing to test leads to a chance node, drawn as a circle: favorable or unfavorable result. Each result leads to another decision node: launch or do not launch. Each launch leads to a chance node: success or failure. Choosing not to test leads directly to the launch decision and then to success or failure at the prior probabilities. Decision nodes and chance nodes are never confused, because one is chosen and the other is not.
Probabilities at Each Chance Node
The probability of a favorable test result is 0.5 times 0.8 plus 0.5 times 0.3, or 0.55; an unfavorable result has probability 0.45. The branches sum to one.
After a favorable result, the probability of success is revised using Bayes' theorem: 0.5 times 0.8, or 0.40, divided by 0.55, about 0.727, with failure about 0.273. After an unfavorable result, the probability of success is 0.5 times 0.2, or 0.10, divided by 0.45, about 0.222, with failure about 0.778. Each pair sums to one, which the analysis checks before rolling back (Anderson et al., 2019).
Rolling Back
The rollback proceeds from right to left, taking expected values at chance nodes and the best alternative at decision nodes.
After a favorable test, launching has an expected value of 0.727 times 300 plus 0.273 times minus 150, about 177.3. Not launching is 0. The bakery would launch, and the node is worth about 177.3.
After an unfavorable test, launching has an expected value of 0.222 times 300 plus 0.778 times minus 150, about minus 50. Not launching is 0. The bakery would not launch, and the node is worth 0.
The test's chance node is worth 0.55 times 177.3 plus 0.45 times 0, about 97.5. Subtracting the 20 test cost gives about 77.5 for the test branch.
Without a test, launching has an expected value of 0.5 times 300 plus 0.5 times minus 150, or 75, against 0 for not launching. The no-test branch is worth 75.
Table 1
Rollback Calculations, Thousands of Dollars
| Node | Calculation | Value |
|---|---|---|
| Launch after favorable test | 0.727 x 300 + 0.273 x (minus 150) | About 177.3 |
| Launch after unfavorable test | 0.222 x 300 + 0.778 x (minus 150) | About minus 50, so do not launch: 0 |
| Test chance node | 0.55 x 177.3 + 0.45 x 0 | About 97.5 |
| Test branch net of cost | 97.5 minus 20 | About 77.5 |
| No test, launch | 0.5 x 300 + 0.5 x (minus 150) | 75 |
The Recommendation Is the First Action
The recommendation is stated as the first action, because everything after it depends on what happens: commission the market test. If the result is favorable, launch; if unfavorable, do not. The test branch is worth about 77.5 against 75 for launching without a test. The expected value of the test's information is 97.5 minus 75, or 22.5, slightly more than its 20 cost, so the test is worth buying, though not by much.
Risk Profiles
Expected values hide the spread of outcomes, so the analysis also shows each strategy's risk profile. Launching without a test gives two outcomes: a 50 percent chance of earning 300 and a 50 percent chance of losing 150. Testing first gives three: about a 40 percent chance of earning 280, success after paying for the test; about a 15 percent chance of losing 170, a failed launch after a misleading favorable test; and about a 45 percent chance of losing the 20 spent on the test and launching nothing. The test strategy trades a lower chance of the best outcome for a much lower chance of the worst, which matters for a bakery that, as earlier analysis showed, cannot easily absorb large losses.
What the Thin Margin Means
The test wins by only 2.5 thousand dollars, so the decision is sensitive to the inputs. If the test cost 25 instead of 20, launching without it would be better. If the test were more accurate, showing a favorable result only 20 percent of the time for a product that would fail, its value would rise. The bakery should negotiate the test's price and ask the research firm about its accuracy before committing, because those two numbers decide the first action. A further consideration favors the test: it limits the worst outcome. Without it, the bakery faces a 50 percent chance of losing 150; with it, the chance of launching a failure falls to about 0.55 times 0.273, about 15 percent.
Why Decision Analysts Draw Trees
Raiffa (1968) set out the approach used here: structure the decision as a sequence of choices and chance events, assign probabilities and payoffs, and fold the tree back from the end to find the best first move. The discipline is useful even when the numbers are rough, because it forces the bakery to state what it would do after each possible test result before paying for the test.
Conclusion
Because the launch decision depends on the test result, the problem needs a tree. Rolled back with every calculation shown, the tree recommends commissioning the 20,000-dollar test and launching only after a favorable result, a choice worth slightly more on average and much safer than launching blind.
References
Anderson, D. R., Sweeney, D. J., Williams, T. A., Camm, J. D., Cochran, J. J., Fry, M. J., & Ohlmann, J. W. (2019). An introduction to management science: Quantitative approaches to decision making (15th ed.). Cengage.
Raiffa, H. (1968). Decision analysis: Introductory lectures on choices under uncertainty. Addison-Wesley.
Render, B., Stair, R. M., Hanna, M. E., & Hale, T. S. (2018). Quantitative analysis for management (13th ed.). Pearson.
The BUS-660 Topic 2 assignment instructions
The Topic 2 assignment in BUS-660 asks MBA students to analyze a sequential decision with a decision tree. Strong analyses choose a problem in which a later decision depends on an earlier uncertainty, mark decision and chance nodes distinctly, check that probabilities at each chance node sum to one and revise them with Bayes' theorem where information arrives. Students should roll back from right to left with every calculation shown, state the recommendation as the first action, compute the value of the information and show each strategy's risk profile. Students should also compute what the test's information is worth and compare it with the test's cost.
How this BUS 660 Topic 2 example is built
The finished example draws a problem that genuinely needs a tree, meaning one where a later choice depends on how an earlier uncertainty resolved. Decision nodes and chance nodes are marked differently and never confused, since one is chosen and the other is not. Every set of branches leaving a chance node sums to one, which the example checks explicitly. Payoffs sit at the ends. The rollback then proceeds from right to left, taking expected values at chance nodes and maxima at decision nodes, with the arithmetic shown at each. The recommendation is stated as the first action rather than as the whole path, because everything after the first branch depends on what happens.
Where the marks sit in the BUS 660 Topic 2 rubric
Faculty reward a tree rolled back in full view. An Excellent paper derives a 0.55 chance of a favorable test and revised success probabilities with Bayes' theorem. Credit goes to a rollback table reaching 177.3 after a favorable test, 0 after an unfavorable one and 77.5 for the test branch. The rubric values stating the recommendation as the first action and computing the test's information value at 22.5. Strong papers show risk profiles cutting the chance of a failed launch to about 15 percent. Top marks go to noting how thin the 2.5-thousand margin is. Papers that state the full decision strategy, launch after a favorable test and abandon after an unfavorable one, rather than only the expected value, show the tree read as a plan.
Common BUS 660 Topic 2 mistakes, and how to avoid them
Taking a maximum at a chance node is the structural error that invalidates a whole tree, and it happens whenever the two node types are not clearly distinguished. A second failure is branch probabilities that do not sum to one, which the example catches by checking and which otherwise propagates silently through every value. Papers lose marks for describing a tree that only a diagram could explain, since a reader without the image should still be able to follow the structure from the text. Recommending an entire path rather than a first action misrepresents how sequential decisions work. Trees drawn for problems with no sequence in them use a heavy tool where a table would have been correct and clearer.
Get a BUS-660 Topic 2 example written to your instructions
Send the BUS-660 Topic 2 problems and the rubric from your classroom, with the sequential decision your section supplied. We write a custom example to those criteria, with node types marked distinctly, branch probabilities verified, the rollback shown at every node and the recommendation stated as a first move, in 24 to 48 hours. The first is free.
More BUS 660 papers and MBA samples
- BUS 660 Topic 1: Payoff Table Analysis
- BUS 660 Topic 3: Forecasting Method Comparison
- BUS 660 Topic 4: Predictive Regression Model
- BUS 660 Topic 5: Linear Programming Formulation
- BUS 660 Topic 6: Network Optimization Problem
- BUS 660 Topic 7: Simulation and Inventory Analysis
- BUS 660 Topic 8: Project Scheduling Recommendation
- BUS 655 Topic 2: Attendance Driver Model
- BUS 635 Topic 2: Dynamic Ticket Pricing Analysis
- ACC 650 Topic 2: Product Costing Problem Set
- HRM 635 Topic 2: Costed Talent Gap Statement
BUS 660 Topic 2 questions, answered
When should I use a tree instead of a payoff table?
When the decision has a sequence in it. A table handles one choice made against uncertainty; a tree handles a choice, then an uncertainty resolving, then another choice that depends on the result. If nothing in your problem happens after something else, a table is simpler and clearer, and using a tree anyway adds structure without adding information.
Why does the rollback go backwards?
Because you can only value a decision once you know what each branch leads to. Working from the terminal payoffs leftward means that by the time you reach a decision node, every option in front of it already has a value attached. Working forwards would require valuing a choice before knowing its consequences, which is exactly the information the tree exists to organize.
What do I do differently at each node type?
At a chance node you take the expected value, weighting each branch by its probability, because you do not control which occurs. At a decision node you take the best value available, because you do control it. Getting these the wrong way round is the commonest error in the topic and it silently produces a completely wrong recommendation.
Where can I find a free BUS 660 Topic 2 sample paper?
The decision tree analysis is printed here in full: why a tree, the inputs, structure, probabilities, the rollback, the first action, risk profiles, the thin margin and the conclusion. Bring your decision problem and we will build the tree at no cost.
Is the market test worth its cost in BUS 660 Topic 2?
Barely. The test's information is worth about 22.5 thousand dollars against a 20-thousand cost, and it cuts the chance of launching a failure from 50 percent to about 15.