| Type: | Ph.D.-level, Open University
Language: English |
|
|
Previous course: C0432
|
|
No credit points with: C0432
|
|
|
|
Prerequisite: 04030/C0403
|
|
|
|
Recommended semester: 7th - 9th semester
|
|
Scope and form: Lectures, excercises and projects.
|
|
Examination: Evaluation of report (13-scale)
|
|
|
|
Remarks: The course is not given in 1999 and 2000. From spring 2001 the course is given every spring.
|
|
|
|
|
|
Department: Informatics and Mathematical Modelling
|
|
Aim: To give an introduction to the theory of large-scale optimization and to the most important areas of application. To make it possible to formulate, structure, analyze and solve problems in connection with complicated, economic and administrative systems. To examplify it by choosing examples from both the public and the private sector, e.g. transport planning, production planning, manpower planning, economic planning, and decentralized planning.
|
|
Contents: Matrix compact methods: Revised simplex; simple and generalised upper bounds. Interior point methods for Linear Programming. Decomposition: Primal and dual methods; applications within transport, resource allocation, production planning, and decentralized planning. Column generation: Grid-linearization; applications within cutting stock problems, and combined transport and production planning problems of nonlinear form. Relaxation and partitioning: The general relaxation idea; solution of linear and nonlinear structured problems. Implementing large-scale models. Aggregation. Heuristics.
|
