This reference describes the indicated catalogue. Check with the institution to confirm the current offer and the conditions applicable to your intake.
Description
Mathematical Programming Formulation and applications of linear and integer programming: simplex method, sensitivity analysis and duality; parametric programming and post-optimality analysis; branch and bound technique; implicit enumeration; cutting plane algorithm. Theory and applications of non-linear optimization: convex sets, convex and concave functions, Kuhn-Tucker conditions; duality in nonlinear programming; computational methods for quadratic and convex programming; geometric programming; dynamic programming.
Reference text in its original language
Mathematical Programming Formulation and applications of linear and integer programming: simplex method, sensitivity analysis and duality; parametric programming and post-optimality analysis; branch and bound technique; implicit enumeration; cutting plane algorithm. Theory and applications of non-linear optimization: convex sets, convex and concave functions, Kuhn-Tucker conditions; duality in nonlinear programming; computational methods for quadratic and convex programming; geometric 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://brocku.ca/webcal/2024/graduate/mgmt.html