Difference between revisions of "Main Page"

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
{| id="mp-topbanner" style="width:100%; background:#f6f6f6; margin-top:1.2em; border:1px solid #ddd;"
 
{| id="mp-topbanner" style="width:100%; background:#f6f6f6; margin-top:1.2em; border:1px solid #ddd;"
 
| style="width:61%; color:#000;" |
 
| style="width:61%; color:#000;" |
<!--        WELCOME TO        -->
 
 
{| style="width:100%; border:none; background:none;"
 
{| style="width:100%; border:none; background:none;"
 
| style="text-align:center; white-space:nowrap; color:#000;" |
 
| style="text-align:center; white-space:nowrap; color:#000;" |
Line 67: Line 66:
 
       <li>[[Facility location problem]]</li>
 
       <li>[[Facility location problem]]</li>
 
       <li>[[Traveling salesman problem]]</li>
 
       <li>[[Traveling salesman problem]]</li>
      <li>[[Portfolio optimization]]</li>
 
 
       <li>[[Set covering problem]]</li>
 
       <li>[[Set covering problem]]</li>
      <li>[[Unit commitment problem]]</li>
 
 
       <li>[[Quadratic assignment problem]]</li>
 
       <li>[[Quadratic assignment problem]]</li>
 
       <li>[[Newsvendor problem]]</li>  
 
       <li>[[Newsvendor problem]]</li>  
 +
      <li>[[Unit commitment problem]]</li>
 +
      <li>[[Portfolio optimization]]</li>
 
</div>
 
</div>
 
|}
 
|}
Line 97: Line 96:
 
       <li>[[Signomial problems]]</li>
 
       <li>[[Signomial problems]]</li>
 
       <li>[[Mixed-integer linear fractional programming (MILFP)]]</li>
 
       <li>[[Mixed-integer linear fractional programming (MILFP)]]</li>
       <li>[[Convex Generalized disjunctive programming (GDP)]]</li>
+
       <li>[[Convex generalized disjunctive programming (GDP)]]</li>
       <li>[[Nonconvex Generalized disjunctive programming (GDP)]]</li>
+
       <li>[[Nonconvex generalized disjunctive programming (GDP)]]</li>
 
       <li>[[Branch and bound (BB) for MINLP]]</li>
 
       <li>[[Branch and bound (BB) for MINLP]]</li>
 
       <li>[[Branch and cut for MINLP]]</li>
 
       <li>[[Branch and cut for MINLP]]</li>
Line 134: Line 133:
 
| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
 
| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk">
 
       <li>[[Protein folding problem]]</li>
 
       <li>[[Protein folding problem]]</li>
       <li>[[Wing Shape Optimization]]</li>
+
       <li>[[Wing shape optimization]]</li>
       <li>[[Optimization in Game Theory]]</li>
+
       <li>[[Optimization in game theory]]</li>
 
       <li>[[Quantum computing for optimization]]</li>
 
       <li>[[Quantum computing for optimization]]</li>
 
</div>
 
</div>

Latest revision as of 18:06, 17 November 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.

Linear Programming (LP)

NonLinear Programming (NLP)

Deterministic Global Optimization

Dynamic Programming

Traditional Applications

Mixed-Integer Linear Programming (MILP)

Mixed-Integer NonLinear Programming (MINLP)

Optimization under Uncertainty

Optimization for Machine Learning and Data Analytics

Emerging Applications

Cornell Prof. Fengqi You Research Group