NUMERICAL METHODS AND APPLICATIONS A
- Overview
- Assessment methods
- Learning objectives
- Contents
- Full programme
- Bibliography
- Teaching methods
- Contacts/Info
Linear algebra, Calculus, Numerical Analysis
Oral examination and a short project on a topic or an algorithm of the course. The student can choose if deepen a theoretical topic of implement an algorithm.
The oral examination will verify the basic tools in optimisation and them application to simple problems.
Students will acquire the basic knowledge in order to model and to solve linear programming problems. Furthermore, they will learn how to apply the basic concepts of nonlinear optimization without constraints.
Introduction to optimization. Examples and fundamental properties of linear programming. Fundamental theorem of linear programming and its geometric interpretation. Simplex method, block form and revised simplex. Dual problem and primal-dual algorithm. The problem of transport and simplex method for transport problems. (about 40 hours)
Unbounded problems: fundamental properties, methods of descent, conjugate direction methods, quasi-Newton methods.
Frontal lectures. (about 24 hours)
Introduction to optimization. Examples and fundamental properties of linear programming. Fundamental theorem of linear programming and its geometric interpretation. Simplex method, block form and revised simplex. Dual problem and primal-dual algorithm. The problem of transport and simplex method for transport problems. (about 40 hours)
Unbounded problems: fundamental properties, methods of descent, conjugate direction methods, quasi-Newton methods.
Frontal lectures. (about 24 hours)
Recommended textbooks:
- “Linear and Nonlinear Programming”, di D. G. Luenberger, Addison-Wesley Publishing Company.
- "Numerical Optimization", di J. Nocedal and S. J. Wright, Springer.
Frontal lessons with theory and exercises
Meeting by appointment.
Borrowed from
click on the activity card to see more information, such as the teacher and descriptive texts.