Quantitative Methods · Decision & Optimization

DynProg: Decision Tree Explorer

Interactive exercise teaching dynamic programming through 5 sequential decision problems: investment allocation, inventory management, option pricing, shortest path, and optimal stopping. Students apply backward induction and Bellman optimality to solve each problem.

5 rounds Executive English, Español
All simulations Get started
Preview

Who it is for

An advanced simulation for participants used to working with the main frameworks and trade-offs of the subject, designed for executive education and experienced professionals.

How a session runs

  1. The instructor creates a session from the Eureka dashboard and invites the participants.
  2. Participants play 5 rounds. In each one they submit their decisions and the simulation calculates the results.
  3. The simulation can be run in English, Español.
  4. The instructor follows each participant's progress and results from the dashboard, and uses the class results for the debrief.

Decisions participants make

The decisions participants make during the simulation:

  • Enter your answer

What participants track

What participants follow on screen as the rounds go by:

  • Your Answer

Subjects covered

Designed for courses in Decision & Optimization.

  • Dynamic Programming & Sequential Decisions

See all Quantitative Methods simulations →

Ready to use DynProg: Decision Tree Explorer with your students?

Contact us and we'll set you up with a free trial session.

Contact us