NMSA413 - Optimization Theory - lecture
Brief outline:
- Geometry in finite dimension, convex sets
- Separation of sets, Farkas' lemma
- Theory of linear programming
- Duality in linear programming
- Transportation problem
- Convex functions, Peano's differenciation of functions
- Theory of nonlinear programming
- Lagrange function, saddle point condition
- Karush-Kuhn-Tucker optimality conditions
- Constraint qualifications, Kuhn-Tucker constraint qualification
- Quadratic programming
Lecture text:
version September 29, 2024
(protected by a password)
Exam information:
types of tasks in written test
,
thematic rings for oral exam
Back to Home Page