Input your registered email address to reset your password
The Chinese University of Hong Kong
Optimization by Linear Programming and Non-Linear Programming
You have to signup an account to view this content. Sign Up Sign In
比Operation research 1 有用。介绍一些运筹学的建模方法、模型。OR领域的基础课。
20% 6 homework, 25% mid-term, 55% final
Non-linear programming: convex sets and functions; local and global optima; Lagrange multipliers; optimality conditions for unconstrained problems; descent methods; constrained optimization; Karush-Kuhn-Tucker conditions; solution methods. Non-differentiable optimization: integer programming models; formulations; cutting-plane methods; branch-and-bound. Dynamic programming: models and formulation; Bellman's equations; solution methods.
Operations Research 2
25% Assignment 25% Midterm 50% Final
Homework, Mid term, Final
If you have any inquiry on RegCourse, please drop us an email. We will get back to you very soon.