Business Mathematics and Statistics · Ch 10 — Operations Research (Transportation Problem, Assignment Problems, Decision Theory)
Decision Theory — Elements and Decision-Making under Uncertainty
Decision Theory — Elements and Decision-Making under Uncertainty
Decision Theory — Elements and Decision-Making under Uncertainty
A decision-making situation in business mathematics has three elements:
- Courses of action (alternatives) — the choices open to the decision-maker, e.g. (which product to launch, how much stock to order).
- States of nature — the possible future conditions the decision-maker cannot control, e.g. (low, medium, high demand).
- Payoff table — a table of the outcome (profit, cost, etc.) for every combination of action and state of nature.
When the probabilities of the states of nature are not known, the situation is decision-making under uncertainty, and four classical criteria are used to pick an action.
Worked example — payoff table (profit, ₹'000)
| Row min | Row max | ||||
|---|---|---|---|---|---|
| 200 | 200 | 200 | 200 | 200 | |
| 100 | 300 | 300 | 100 | 300 | |
| 50 | 200 | 400 | 50 | 400 |
1. Maximax criterion (the optimist) — pick the action whose best possible outcome is highest. Row maxima: , , . The highest is 400 → choose .
2. Maximin criterion (Wald, the pessimist) — pick the action whose worst possible outcome is least bad. Row minima: , , . The highest is 200 → choose .
3. Minimax Regret criterion (Savage) — build a regret (opportunity-loss) table: in each state-of-nature column, regret = (column's best payoff) − (that action's payoff). Column bests are (from ), (from ), (from ):
| Max regret | ||||
|---|---|---|---|---|
| 0 | 100 | 200 | 200 | |
| 100 | 0 | 100 | 100 | |
| 150 | 100 | 0 | 150 |
Pick the action with the smallest maximum regret: → choose .
4. Laplace (equal-probability) criterion — since nothing is known about likelihood, treat all states as equally likely and pick the action with the highest average payoff:
The highest average is (233.33) → choose .
Summary
| Criterion | Recommended action |
|---|---|
| Maximax (optimistic) |
A table listing the outcome (profit, cost, etc.) for every combination of a course of action and …
Choose the action whose best possible payoff (row maximum) is the highest among all actions — the opt …
Choose the action whose worst possible payoff (row minimum) is the highest among all actions — the conservati …
Build a regret table (column best minus each payoff), then choose the action with the smallest of the row-w …
Treat every state of nature as equally likely and choose the action with the highest simpl …