Faculty of BSU

1. |
Discipline |
Combinatorics and Operations Research |

2. |
Course Specialty |
3, Mathematics and Information (Web Programming and Internet Technologies) |

3. |
Semester |
6 |

4. |
Amount of credits |
3 |

5. |
Full name of the lecturer |
Buzulutskaya Hanna Nikolaevna |

6. |
Objectives of studying the discipline |
Investigation of basic methods of solving extremal problems in graph theory and linear programming. Increasing the professional competence. Formation of students’ skills in abstract mathematical thinking and the ability of applying it to specific tasks. Improving students’ mathematical culture. After the study as a result a student should be able to: – to build mathematical models of discrete optimization problems, dynamic programming problems, linear programming; – solve the problems of discrete optimization, dynamic programming, linear programming – use the simplex method for solving linear programming problems; – use methods for solving linear problems and transport tables for solving transport problems. – to build mathematical models of discrete optimization problems, dynamic programming problems, linear programming; – solve the problems of discrete optimization, dynamic programming, linear programming – use the simplex method for solving linear programming problems; – use methods for solving linear problems and transportation problems. |

7. |
Basis |
Mathematical analysis Algebra and Number Theory |

8. |
Main contant |
The problem of linear programming. Convex sets, separation theorems. Extreme points in canonical linear problems. Nondegenerate problems. Simplex method. The duality theory. Transport problem. Methods for finding the initial solution: the northwest corner method, the least cost method, the Vogel method. Method of potentials. Fundamentals of decision theory under uncertainty. Linear programming problem. Convex sets, separation theorems. Extreme points in canonical linear problems. Nondegenerate problems. Simplex method. The duality theory. Transportation problem. Methods for finding the initial solution: the northwest corner method, the least cost method, the Vogel method. Method of potentials. Fundamentals of decision theory under uncertainty. |

9. |
Recommended literature |
1. Galeev E.М., Tichomirov V.M. A short course in the theory of extremal problems. – Moscow, Moscow State University, 1989. 2. Alekseev V.M., Galeev E.M., Tikhomirov V.M. Collection of tasks on optimization. Theory. Examples, Tasks. Study Guide: – Moscow, Science, 1984. 3. Bakhtin VI, Ivanishko IA, Lebedev AV, Pindrik OI Linear programming. Methods. |

10. |
Teaching Methods |
Lectures, practical lessons, … |

11. |
Language |
Russian |

12. |
Current control |
Tests |

13. |
Appraisal Form |
Exam |