Problem preview
S-MD.7 Core M3-055-R10-V01

Analyze decisions and strategies using probability concepts in more complex settings.

Apply explicit downside constraints before optimizing

Problem

Alternative A pays \(+\$40\) with probability \(0.9\) and \(-\$200\) with probability \(0.1\); B pays \(+\$10\) for certain. Maximize EV only among alternatives with maximum loss at most \(\$100\). Compute EVs, test eligibility, and recommend.

Big Picture

What this problem is really about

A constrained decision has two stages, and reversing them changes the problem. First compute the downside measure named in the rule and remove every alternative that crosses the hard limit. Expected value becomes the objective only inside the remaining feasible set, so a higher average cannot rescue an alternative that failed the eligibility test.

Inside Gozunta

Turn the preview into practice.

More than a preview

Gozunta lets you study this problem—and more than 10,000 others.

Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.

Discover Gozunta Try it now
Four variants of this problem type
Curriculum context
Course
Math III
Standard
S-MD.7
Category
Statistics and Probability
Domain
Using Probability to Make Decisions
Objective
Analyze decisions and strategies using probability concepts in more complex settings.
Problem type
Apply explicit downside constraints before optimizing