FI:M026 Linear Programming - Course Information

M026 Linear Programming

Faculty of Informatics
Spring 1996

Extent and Intensity

0/0. 3 credit(s). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).

Teacher(s)

doc. RNDr. Jiří Kaďourek, CSc. (lecturer)

Guaranteed by

Contact Person: doc. RNDr. Jiří Kaďourek, CSc.

Prerequisites

Before enrolling this course the students should go through M003 Linear Algebra and Geometry I and M004 Linear Algebra and Geometry 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

Syllabus

Linear programming represents one of the basic optimization methods with a wide range of applications. The technique of linear programming, namely the so-called simplex method, is one of the mathematical algorithms most widely exploited on computers. The theoretical foundations of linear programming consist in the study of systems of linear inequalities. The main topics of the lecture follow.
The theory of linear inequalities -- the Farkas' lemma.
The Duality theorem of linear programming.
Convex cones and polyhedra.
Faces of polyhedra.
The geometric description of the simplex method.
The simplex method in tableau form.
The revised simplex method.
The dual simplex method.
The transportation problem and its solution by an adaptation of the simplex method.

Language of instruction

Czech