1 / 13

by Ahmed Aseeri April 2, 2014

PLANNING UNDER UNCERTAINTY . REGRET THEORY . by Ahmed Aseeri April 2, 2014. MINIMAX REGRET ANALYSIS. It’s a feeling…. … measurable . MINIMAX REGRET ANALYSIS. If chosen decision is the best  Zero regret Nothing is better than the best  No negetive Regret.

lorin
Download Presentation

by Ahmed Aseeri April 2, 2014

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. PLANNING UNDER UNCERTAINTY REGRET THEORY by Ahmed Aseeri April 2, 2014

  2. MINIMAX REGRET ANALYSIS • It’s a feeling… • … measurable .

  3. MINIMAX REGRET ANALYSIS • If chosen decision is the best  Zero regret • Nothing is better than the best  No negetive Regret

  4. MINIMAX REGRET ANALYSIS Motivating Example • Traditional way Maximize Average…select A • Optimistic decision maker MaxiMax … select C • Pessimistic decision maker MaxiMmin … select D

  5. MINIMAX REGRET ANALYSIS Motivating Example • Calculate regret: find maximum regret • A … regret = 8 @ low market • C … regret = 9 @ low market • D … regret = 10 @ high market • B … regret = 7 @ medium market • MINIMAX B • In general, gives conservative decision but not pessimistic.

  6. Two-Stage Model Optimal Profit Uncertainty Free Optimal Profit Here & Now (HN) Wait & See (WS) MINIMAX REGRET ANALYSIS Two-Stage Stochastic Programming Using Regret Theory

  7. MINIMAX REGRET ANALYSIS Two-Stage Stochastic Programming Using Regret Theory where: subject to: , subject to: ,

  8. where: subject to: , subject to: , MINIMAX REGRET ANALYSIS Two-Stage Stochastic Programming Using Regret Theory

  9. MINIMAX REGRET ANALYSIS Two-Stage Stochastic Programming Using Regret Theory where: subject to: , subject to: ,

  10. MINIMAX REGRET ANALYSIS Two-Stage Stochastic Programming Using Regret Theory

  11. MINIMAX REGRET ANALYSIS Limitations on Regret Theory • It is not necessary that equal differences in profit would always correspond to equal amounts of regret: $1000 - $1050 = 50 $100 - $150 = 50 • A small advantage in one scenario may lead to the loss of larger advantages in other scenarios. • May select different preferences if one of the alternatives was excluded or a new alternative is added.

  12. versus instead of: 1050-1000 = 50 150-100 = 50 versus CONCLUSION Suggested improvements to minimax-regret criterion: • Minimizing the average regret instead of minimizing the maximum. • Minimizing the upper regret average instead of the maximum only. • Measure relative regret instead of absolute regret:

  13. END

More Related