Editing Curse of dimensionality (section)

=== Optimization ===
When solving dynamic [[optimization (mathematics)|optimization]] problems by numerical [[backward induction]], the objective function must be computed for each combination of values. This is a significant obstacle when the dimension of the "state variable" is large.<ref>{{cite book |first=C. Robert |last=Taylor |chapter=Dynamic Programming and the Curses of Dimensionality |title=Applications Of Dynamic Programming To Agricultural Decision Problems |publisher=Westview Press |year=1993 |isbn=0-8133-8641-1 |pages=1–10 |chapter-url=https://books.google.com/books?id=71SsDwAAQBAJ&pg=PA1 }} </ref>