Useful Links
Systems Science
Optimization Theory
1. Foundations of Optimization
2. Mathematical Foundations
3. Unconstrained Optimization
4. Constrained Optimization Theory
5. Linear Programming
6. Nonlinear Programming
7. Integer and Combinatorial Optimization
8. Dynamic Programming
9. Stochastic Optimization
10. Heuristic and Metaheuristic Methods
11. Multi-Objective Optimization
12. Specialized Optimization Topics
13. Applications and Case Studies
14. Computational Aspects and Software
Stochastic Optimization
Stochastic Programming Fundamentals
Uncertainty Modeling
Probability Distributions
Scenario-Based Approaches
Expected Value Problems
Two-Stage Stochastic Programming
Here-and-Now vs Wait-and-See Decisions
Recourse Functions
L-Shaped Method
Benders Decomposition
Multi-Stage Stochastic Programming
Decision Trees
Scenario Trees
Non-Anticipativity Constraints
Progressive Hedging Algorithm
Chance-Constrained Programming
Individual Chance Constraints
Joint Chance Constraints
Probabilistic Programming
Sample Average Approximation
Robust Optimization
Uncertainty Sets
Box Uncertainty
Ellipsoidal Uncertainty
Polyhedral Uncertainty
Robust Counterpart Formulation
Adjustable Robust Optimization
Distributionally Robust Optimization
Stochastic Approximation
Robbins-Monro Algorithm
Stochastic Gradient Methods
Convergence Analysis
Applications to Machine Learning
Previous
8. Dynamic Programming
Go to top
Next
10. Heuristic and Metaheuristic Methods