# Difference between revisions of "Main Page"

Jump to navigation
Jump to search

Line 82: | Line 82: | ||

|- valign="top" | |- valign="top" | ||

+ | |<br />''' Dynamic Programming''' | ||

+ | # [[Bellman equation]] | ||

+ | # [[Eight step procedures]] | ||

+ | # [[Stochastic dynamic programming]] | ||

+ | <br /> | ||

|<br />''' Optimization for Machine Learning and Data Analytics''' | |<br />''' Optimization for Machine Learning and Data Analytics''' | ||

Line 93: | Line 98: | ||

<br /> | <br /> | ||

− | |<br />''' | + | |

+ | |||

+ | |- valign="top" | ||

+ | |||

+ | |||

+ | |<br />''' Traditional Applications''' | ||

# [[Facility location problem]] | # [[Facility location problem]] | ||

# [[Traveling salesman problem]] | # [[Traveling salesman problem]] | ||

Line 102: | Line 112: | ||

# [[Optimization in Game Theory]] | # [[Optimization in Game Theory]] | ||

<br /> | <br /> | ||

+ | |||

+ | |<br />''' Emerging Applications''' | ||

+ | |||

+ | # [[Facility location problem]] | ||

+ | # [[Traveling salesman problem]] | ||

+ | # [[Portfolio optimization]] | ||

+ | # [[Set covering problem]] | ||

+ | # [[Unit commitment problem]] | ||

+ | # [[Wing Shape Optimization]] | ||

+ | # [[Optimization in Game Theory]] | ||

+ | <br /> | ||

|} | |} | ||

## Revision as of 10:48, 30 August 2020

**Welcome to the Cornell University Computational Optimization Open Textbook.**

This electronic textbook is a student-contributed open-source text covering a variety of topics on process optimization.

If you have any comments or suggestions on this open textbook, please contact Professor Fengqi You.

Cornell Open Textbook on Computational Optimization