| studiehandbok@lith | |
|
|
|
|
|
| TAOP60 | Mathematical Programming, 3 p (sw) /Matematisk programmering/ Advancement level: D | |
| Aim: The course intends to give deeper knowledge of the mathematical background to the methods that have been presented in the basic course, to give knowledge on modern optimizing methods and to develope the ability to independently apply theory and methods on specific problems.Prerequisites: TAOP 08 Optimization, basic course YCourse organization: Lectures develope theory. Storseminarier are devoted to applications and solution methods. The seminars consist of computer exercises on algorithm development and on application of standard methods on specific problems.Course content: Necessary and sufficient conditions for local optima. Order of convergence the revised simplex method. Quadratic programming. Methods for nonlinear optimization without constraints: Conjugate gradients, Quasi-Newton and Newton methods. Methods for nonlinear programming with constraints. Barrier and penalty function methods, Sequential quadratic programming, Interior point methods for LP, Semidefinite programming.Course literature: Luenberger, D.: Linear and Nonlinear Programming, 2nd ed., Addison-Wesley, 1984. | ||
| |
|
|
 |
|||||
|
|
||||||
