PřF:M4110 Linear programming - Course Information
M4110 Linear programming
Faculty of ScienceSpring 2000
- Extent and Intensity
- 2/1/0. 5 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Jiří Kaďourek, CSc. (lecturer)
- Guaranteed by
- doc. RNDr. Jiří Kaďourek, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: doc. RNDr. Jiří Kaďourek, CSc. - Prerequisites (in Czech)
- M2110 Linear algebra II
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Mathematics - Economics (programme PřF, M-AM)
- Mathematics (programme PřF, B-MA)
- Mathematics (programme PřF, M-MA)
- Mathematics (programme PřF, N-MA)
- Syllabus
- Linear programming problems.
- Linear inequalities --- the Farkas' lemma.
- The Duality theorem of linear programming.
- Convex cones and polyhedra.
- The Decomposition theorem for polyhedra.
- The structure of polyhedra --- faces, facets and vertices.
- The geometric description of the simplex method.
- The simplex method in tableau form.
- The Bland's rule, the two-phases method.
- The revised simplex method.
- The geometric description of the dual simplex method.
- The dual simplex method in tableau form.
- The treansportation problem.
- Solving the transportation problem by an adaptation of the simplex method.
- Literature
- PLESNÍK, Ján, Jitka DUPAČOVÁ and Milan VLACH. Lineárne programovanie. 1. vyd. Bratislava: Alfa, vydavateľstvo technickej a ekonomickej literatúry, 1990, 314 s. ISBN 80-05-00679-9. info
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
The course is taught: every week.
- Enrolment Statistics (Spring 2000, recent)
- Permalink: https://is.muni.cz/course/sci/spring2000/M4110