SylabUZ
| Course name | Operations Research |
| Course ID | 06.9-WM-ER-ZiIP-20_18 |
| Faculty | Faculty of Mechanical Engineering |
| Field of study | WM - oferta ERASMUS |
| Education profile | - |
| Level of studies | Erasmus programme |
| Beginning semester | winter term 2023/2024 |
| Semester | 1 |
| ECTS credits to win | 5 |
| Course type | obligatory |
| Teaching language | english |
| Author of syllabus |
|
| The class form | Hours per semester (full-time) | Hours per week (full-time) | Hours per semester (part-time) | Hours per week (part-time) | Form of assignment |
| Lecture | 30 | 2 | - | - | Exam |
| Project | 30 | 2 | - | - | Credit with grade |
Transfer of basic knowledge and acquisition by students of skills and competences in the field of operations research, which will be used in the further education process and useful in future professional work.
Basic Mathematics Course, Information Technology.
Lecture content
L1. Preliminary issues. Basic elements and problems of operational research. Linear programming problem. Geometric method of solving the problem LP.
L2. Simplex method.
L3. Two-phase method and Big M method. Problems with Simplex.
L4. Duality and sensitivity analysis. The Dual Simplex Method.
L5. The Transportation Problem.
L6. The Assignment and Traveling Salesman Problems.
L7. Integer Programming. Gomory's cutting plane algorithm and the Branch-and-Bound Technique.
L8. Network analysis. Basic concepts of graphs. The Terminology of Networks.
L9. Shortest Path Method. Applications in technology.
L10. Project management technique. Critical path method. CPM and the Gantt chart.
L11. Time-cost analysis. PERT method. Computer aided network analysis.
L12. Components and classification of queuing systems. Kendal notation. Little's laws. Rate diagram for the birth and death process. Laws for constructing a system of equations.
L13. A single-channel system with an exponential distribution of service time and the arrival strems. Applications.
L14. Multi-channel system with a simple fluxes. Simple Streams. Applications.
L15. Computer-aided research of queuing systems. Final remarks.
Project
P1. Presentation of the course program, learning outcomes and assignment conditions. Characteristics of individual topics carried out during the project classes.
P2-3. Geometric method of solving the linear programming problem.
P4-9. Simplex Methods - maximisation and minimisation case, simplex algorithm, dual simplex method, big M method. OFC (Objective Function Coefficient) and RHS (Right Hand Side) sensitivity analysis. Integer programming.
P10-11. The transportation problem, formulation and types. The transportation problem, formulation and types. Methods of generating the basic solution. Optimization of the basic solution. Degeneracy in the transportation problem.
P12. The assignment problem.
P13-14. Project planning and scheduling - CPM and PERT techniques.
P15. Summary of completed problems. Completion of the project classes.
Conventional lecture..
Project - individual and group work of students using literature and lecture notes.
| Outcome description | Outcome symbols | Methods of verification | The class form |
Lecture: exam
Grade based on a written exam that verifies the knowledge of basic issues.
Project: graded credit
The grade is determined on the basis of the component evaluating skills related to the implementation of project tasks, preparation of reports and the component for "defense" by the student of individual reports.
Final grade: arithmetic average of grades from the above-mentioned forms of classes.
Modified by dr inż. Tomasz Belica (last modification: 06-02-2024 18:45)
