Main Page: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
No edit summary
Line 1: Line 1:
<strong>MediaWiki has been installed.</strong>
<!-- Header table. Introduction. -->
'''Welcome to the Northwestern University Process Optimization Open Textbook.''' <br />
This electronic textbook is a student-contributed open-source text covering a variety of topics on process optimization.
<br />
If you have any comments or suggestions on this open textbook, please contact [//www.orie.cornell.edu/orie/people/field-profile.cfm?netid=fy86_field  Professor Fengqi You].
<br />
----
<br /><br />
<font size="6">Northwestern University Open Text Book on Process Optimization</font>
 
{| class="wikitable" style="padding: 1em; text-align:left"
|- valign="top"
|width = "400pt"|<br />'''&nbsp;&nbsp;Linear Programming (LP)'''
# [[Computational complexity]]
# [[Matrix game (LP for game theory)]]
# [[Network flow problem]]
# [[Interior-point method for LP]]
# [[Optimization with absolute values]]
<br />
 
|width = "400pt"|<br />'''&nbsp;&nbsp;Mixed-Integer Linear Programming (MILP)'''
# [[Facility location problems]]
# [[Traveling salesman problems]]
# [[Mixed-integer cuts]]
# [[Disjunctive inequalities]]
# [[Lagrangean duality]]
# [[Column generation algorithms]]
# [[Heuristic algorithms]]
# [[Branch and cut]]
<br />
 
|- valign="top"
|<br />'''&nbsp;&nbsp;NonLinear Programming (NLP)'''
# [[Line search methods]]
# [[Trust-region methods]]
# [[Interior-point method for NLP]]
# [[Conjugate gradient methods]]
# [[Quasi-Newton methods]]
# [[Quadratic programming]]
# [[Sequential quadratic programming]]
# [[Subgradient optimization]]
# [[Mathematical programming with equilibrium constraints]]
# [[Dynamic optimization]]
# [[Geometric programming]]
# [[Nondifferentiable Optimization]]
<br />
 
|<br />'''&nbsp;&nbsp;Mixed-Integer NonLinear Programming (MINLP)'''
# [[Signomial problems]]
# [[Mixed-integer linear fractional programming (MILFP)]]
# [[Convex Generalized disjunctive programming (GDP)]]
# [[Nonconvex Generalized disjunctive programming (GDP)]]
# [[Branch and bound (BB)]]
# [[Branch and cut for MINLP]]
# [[Generalized Benders decomposition (GBD)]]
# [[Outer-approximation (OA)]]
# [[Extended cutting plane (ECP)]]
<br />
 
|- valign="top"
 
|<br />'''&nbsp;&nbsp;Global Optimization'''
# [[Exponential transformation]]
# [[Logarithmic transformation]]
# [[McCormick envelopes]]
# [[Piecewise linear approximation]]
# [[Spatial branch and bound method]]
<br />
 
|<br />'''&nbsp;&nbsp;Optimization under Uncertainty'''
# [[Stochastic programming]]
# [[Chance-constraint method]]
# [[Fuzzy programming]]
# [[Classical robust optimization]]
# [[Adaptive robust optimization]]
# [[Data driven robust optimization]]
<br />
 
 
|- valign="top"
 
|<br />'''&nbsp;&nbsp;Featured Applications'''
# [[Wing Shape Optimization]]
# [[Applying Optimization in Game Theory]]
<br />
 
|}
 


Consult the [https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents User's Guide] for information on using the wiki software.
Consult the [https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents User's Guide] for information on using the wiki software.

Revision as of 17:24, 26 August 2020

Welcome to the Northwestern University Process 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.



Northwestern University Open Text Book on Process Optimization


  Linear Programming (LP)
  1. Computational complexity
  2. Matrix game (LP for game theory)
  3. Network flow problem
  4. Interior-point method for LP
  5. Optimization with absolute values
  Mixed-Integer Linear Programming (MILP)
  1. Facility location problems
  2. Traveling salesman problems
  3. Mixed-integer cuts
  4. Disjunctive inequalities
  5. Lagrangean duality
  6. Column generation algorithms
  7. Heuristic algorithms
  8. Branch and cut



  NonLinear Programming (NLP)
  1. Line search methods
  2. Trust-region methods
  3. Interior-point method for NLP
  4. Conjugate gradient methods
  5. Quasi-Newton methods
  6. Quadratic programming
  7. Sequential quadratic programming
  8. Subgradient optimization
  9. Mathematical programming with equilibrium constraints
  10. Dynamic optimization
  11. Geometric programming
  12. Nondifferentiable Optimization
  Mixed-Integer NonLinear Programming (MINLP)
  1. Signomial problems
  2. Mixed-integer linear fractional programming (MILFP)
  3. Convex Generalized disjunctive programming (GDP)
  4. Nonconvex Generalized disjunctive programming (GDP)
  5. Branch and bound (BB)
  6. Branch and cut for MINLP
  7. Generalized Benders decomposition (GBD)
  8. Outer-approximation (OA)
  9. Extended cutting plane (ECP)



  Global Optimization
  1. Exponential transformation
  2. Logarithmic transformation
  3. McCormick envelopes
  4. Piecewise linear approximation
  5. Spatial branch and bound method
  Optimization under Uncertainty
  1. Stochastic programming
  2. Chance-constraint method
  3. Fuzzy programming
  4. Classical robust optimization
  5. Adaptive robust optimization
  6. Data driven robust optimization




  Featured Applications
  1. Wing Shape Optimization
  2. Applying Optimization in Game Theory



Consult the User's Guide for information on using the wiki software.

Getting started

Retrieved from "https://optimization.cbe.cornell.edu/index.php?title=Main_Page&oldid=2"