Linear Programming

Course Code:
11LP
Academic Degree:
bachelor
Study Programme:
Technology in Transportation and Telecommunications (B 3710)
semesterlanguagestudy field / specialization
4czechBEZ Security Technologies in Transportation - 3708R047
4czechLOG Logistics and Transport Processes Control - 3708R046
Form of Study:
full-time and part-time
Credits:
3
Number of Hours:
2 + 1 hours per week - in full-time study
12 hours per semester - in part-time study
Type of Course:
obligatory
Course Completion:
classified credit
Course Tutor:
 
roh  Lectures:
doc. RNDr. Ondřej Navrátil, Ph.D.
roh  Training Course:
RNDr. Olga Vraštilová
roh  Part-time Study:
doc. RNDr. Ondřej Navrátil, Ph.D.
Supervising Department:
Department of Applied Mathematics (16111)
Keywords:
simplex method, duality principle, stability of solution, traffic problem
Abstract:
Formulation of the problem of linear programming, transcription of some practical problems to the linear programming problems. Simplex and convex polyedra. Simplex method, basic solutions, duality principle in linear programming, stability of solution of linear programming problem. Traffic problem.
Objectives:
To acquaint students with the method of linear programming and types of practical problems, which can be solved using this method.