CS 6270Optimization Techniques
Wright State University-Main Campus · 3 credits

Catalog
Algorithms for optimizing real functions of several variables subject to equality and inequality constraints. Convexity properties of functions and sets, linear programming, simplex and interior point methods, integer programming, branch and bound algorithm, transportation problem, necessary and sufficient conditions for nonlinear function optimization, Newton and quasi-Newton methods, Lagrange multiplier conditions, Kuhn-Tucker conditions, dynamic programming.
Recent sections
Spring 2027 · 1 section
Jan 11 – May 1
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 01Class #28039 | Mo We · 2:30 – 3:50 PM | Dayton | Not published |