MATH-434 * /0.5 Linear and Nonlinear Optimization 3L

Optimization of functions of several variables, restricted by equality and inequality constraints, with applications. Linear programming, including convexity, simplex algorithm, duality, sensitivity analysis. Techniques of unconstrained optimization. Constrained optimization, including Lagrangian, Kuhn-Tucker conditions, convexity, duality, numerical techniques. Given jointly with MATH 834*. PREREQUISITES





There are no comments for this course.