Introduction to optimization

Basic data
Detailed data
Classes
Consultations schedule

Code:	45700
ECTS:	5.0
Lecturers in charge:
English level: 1,0,0	All teaching activities will be held in Croatian. However, foreign students in mixed groups will have the opportunity to attend additional office hours with the lecturer and teaching assistants in English to help master the course materials. Additionally, the lecturer will refer foreign students to the corresponding literature in English, as well as give them the possibility of taking the associated exams in English.

Load:

1. komponenta

Lecture type Total

* Load is given in academic hour (1 academic hour = 45 minutes)

Description:

COURSE AIMS AND OBJECTIVES: Aim of the course is to understand simplex method, duality theory in LP with application to game theory and understand some basic methods of unconstrained optimization.

COURSE DESCRIPTION AND SYLLABUS:
1. Dictionary, simplex algorithm. Primal and dual dictionary, solving system of inequalities. Prima--dual algorithm.
2. Finitely generated conuses. Blandt's theorem and separation theorem for FGC. Weyl's theorem,
3. Conus duality, polihedral sets and representation theorem. Duality in LP and application to matrix games.
4. Unconstrained optimisation. Stepest descent, Newton method, Line-search optimisation, conjugate directions.

Literature:

Consultations schedule:

For consultation hours, please contact the course lecturers.

Content

Link to the course web page: http://www.pmf.unizg.hr/math/predmet/uuo

All information and materials are available on Merlin:

News

News archive

Poll

Repository

Introduction to optimization

1. komponenta

Content

News

FACULTY OF SCIENCE