Learning area
Optimization & Decision Science
Learn to express decisions as objectives and constraints, interpret solver evidence, and validate choices under discrete structure and uncertainty.
Prerequisites
Start after linear algebra and probability fundamentals.
What this path covers
- Decision models, feasibility, convexity, linear programs, and duality
- Integer, network, scheduling, routing, constraint, and nonlinear models
- Stochastic, robust, simulation-based, and heuristic optimization
- Solver evidence, model validation, predictive links, and a local project
Lessons are published in source-reviewed batches with deterministic, local exercises. No hosted account is required.
Start with the path from prediction to decision