Linear programming 3.1.KRK.12SY.PLin
Program content
Lecture/practical classes issues:
Linear programming problem: definition of the linear programming problem (LPP) and the most important examples, feasible and optimal solutions, geometryof LPP.
Simplex algorithm: description of the method, simplex tableaux method, initialization and periodicity of the algorithm.
Dualism: dual LPP, principles of duality, applications of dual problems.
Type of course
Requirements
Course coordinators
Learning outcomes
Knowledge:
The student knows the examples of mathematical models that lead to linear programming problems.
The student knows the symplex algorithm, its properties and applications.
Skills:
The student is able to write in a mathematical form a decision-making problem and interpret the data resulting from linear programming.
The student has the ability to design algorithms in search for optimal decisions from the point of view of accepted criteria and limitations.
The student solves decision-making problems by using the right tools and optimization models.
Social competence:
The student intuitively understands the importance of linear programming and sees the sense of developing their competence in this subject.
The student is able to precisely formulate questions to deepen one's understanding of a given topic or to find the missing elements of reasoning.
Assessment criteria
The form and method of passing shall take place on the general principles set out in the education program, in particular:
(Lecture) written / oral exam;
(Seminar) determining the final grade on the basis of partial marks received during the semester for oral presentations and for written tests.
The basic criterion of the assessment:
(L) obtaining a positive exam grade;
(S) obtaining a positive final grade.
Bibliography
Literature used during classes:
1. Robert J. Vanderbei: Linear Programming. Foundations and Extensions, Springer, 2008 r.
2. Andrzej Cegielski: Programowanie liniowe. Część I, Uniwersytet Zielonogórski, 2002 r.
3. Saul I. Gass: Programowanie liniowe, PWN, 1973 r.
Literature studied independently by the student:
1. Dariusz Horla: Metody obliczeniowe optymalizacji w zadaniach. Wyd. II, Politechnika Poznańska, 2016 r.
2. Wiesław Grabowski: Programowanie matematyczne, Państwowe Wydawnictwo Ekonomiczne, 1980 r.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: