Přístupnostní navigace
E-application
Search Search Close
Course detail
FP-mopPAcad. year: 2025/2026
Completion and deepening of mathematical knowledge to students continuing in the master study of more immediate practical need areas - optimization problems, matrix games and linear programming, nonlinear programming, and more.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Entry knowledge
Rules for evaluation and completion of the course
Requirements to obtain credit:" to attend exercise sessions according to the given conditions of controlled classesThe exam is composed of two parts- written and oral, whereby a written part makes the main proportion. The length of a written part is 1 hour. The written part is evaluated as the sum of ratings of both tasks. If a student does not obtain at least 50% points out of all, the written part and the whole exam is graded "F" and a student does not proceed to oral part. Attendance at lectures is not controlled. Attendance at exercises(problem sessions) is compulsory and is regularly checked. A student is obliged to give reasons for his absence. The teacher has a full competency to judge the reasons. In the affirmative, the teacher states the form of the compensation for the missed classes
Aims
Study aids
Prerequisites and corequisites
Basic literature
Recommended reading
Classification of course in study plans
Lecture
Teacher / Lecturer
Syllabus
1. Optimization problems and their formulation. Applications in statistics and economics.2. Fundamentals of Convex Analysis (convex sets, convex functions of several variables).3. The role of linear programming (duality, structure of the set of admissible solutions, simplex method, Farkas theorem). Transportation problem as a special type of linear programming.4. Additional to linear programming (post-optimalization, stability). Matrix games and linear programming, Minimax theorem.5. Symmetrical nonlinear programming (local and global optimality conditions, conditions of regularity).6. Quadratic programming as a special type of symmetric nonlinear programming.
Exercise