Description
Methods for unconstrained and constrained optimization problems; Kuhn-Tucker conditions; penalty functions; duality; quadratic programming; geometric programming; separable programming; integer nonlinear programming; pseudo-Boolean programming; dynamic programming.
Reference text in its original language
Methods for unconstrained and constrained optimization problems; Kuhn-Tucker conditions; penalty functions; duality; quadratic programming; geometric programming; separable programming; integer nonlinear programming; pseudo-Boolean programming; dynamic programming.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/grad/courses/MATH/