Week |
Scientific subject |
Number of Hours |
Lecture |
exercises |
1-2 |
Introduction: Examples illustrating the formulation of the mathematical model for linear programming issues. |
6 |
Ö |
Ö |
3-4 |
Some basic concepts of linear programming, linear programming problem components and vertices, and the graphical method. |
6 |
Ö |
Ö |
5 |
First Midterm ( 2 hours) |
|||
5-6 |
Systems of equations, standard form, changing of fundamentals, modulation, possible principal solutions, preserving the initial possibility, class selection of the pivot. |
4 |
Ö |
Ö |
7-8-9 |
The simplified method, the objective function and the scheduler, finding an initial possible schedule, the two-stage simplified method, limitations of the simplified method, alternative optimal solutions, avoiding circularity. |
9 |
Ö |
Ö |
10 |
Second Midterm ( 2 hours) |
|||
10-11 |
Modified Arithmetic Method, Modified Simplified Method, Multiplication Formula, Modified Pivot Column Selection, Modified Pivot Row. |
4 |
Ö |
Ö |
12-13 |
Conjugation simplified conjugation method, conjugation problem, relaxed complement terms, simplified conjugation method, its results, meaning of conjugate variables. |
6 |
Ö |
Ö |
14 |
sensitivity analysis, discrete variables, parametric programming, limited parametric programming |
3 |
Ö |
Ö |
|
Final Exam |
|||
|
Total |
42 |
|
|
References
Operations research and linear programming / Dr. Thana Rashid Sadiq