Prerequisites and co-requisites |
|
Language of instruction |
English |
Type |
Elective |
Level of Course |
Bachelor's |
Lecturer |
Asst. Prof. Omid SHARIFI |
Mode of Delivery |
Face to Face |
Suggested Subject |
|
Professional practise ( internship ) |
None |
Objectives of the Course |
Mathematical Programming: Linear, Integer and Quadratic Programs - Linear Programming: Simplex and Dual Simplex Methods, Duality and Precision Analysis, Expansions - Integer Programming: Branch Boundary, Cutting and Transportation Algorithms - Nonlinear Programming: Single Variable Optimization, Multivariate Constrained and Unconstrained CPM - Inventory Models - Estimation Models: Regression Methods, Plane Methods - Game Theory - Decision Theory - Markov Processes - Queuing Systems: Optimization - Dynamic Programming - Network Analysis: Minimum Span, Shortest Path, and Maximum Flow Problems - Project Management: PERT / CPM - M / M / 1, M / M / s, M / M / 1 / K and M / M / s / K Systems |
Contents of the Course |
Mathematical Programming: Linear, Integer and Quadratic Programs - Linear Programming: Simplex and Dual Simplex Methods, Duality and Precision Analysis, Expansions - Integer Programming: Branch Boundary, Cutting and Transportation Algorithms - Nonlinear Programming: Single Variable Optimization, Multivariate Constrained and Unconstrained CPM - Inventory Models - Estimation Models: Regression Methods, Plane Methods - Game Theory - Decision Theory - Markov Processes - Queuing Systems: Optimization - Dynamic Programming - Network Analysis: Minimum Span, Shortest Path, and Maximum Flow Problems - Project Management: PERT / CPM - M / M / 1, M / M / s, M / M / 1 / K and M / M / s / K Systems |
# |
Subjects |
Teaching Methods and Technics |
1 |
Mathematical Programming: Linear, Integer and Quadratic Programs |
Lecture |
2 |
Mathematical Programming: Linear, Integer and Quadratic Programs |
Lecture |
3 |
Linear Programming: Simplex and Dual Simplex Methods, Duality and Precision Analysis, Expansions |
Lecture |
4 |
Integer Programming: Branch Bounding, Cutting and Transportation Algorithms |
Lecture |
5 |
Nonlinear Programming: Single Variable Optimization, Multivariate Constrained and Unconstrained Optimization |
Lecture |
6 |
Dynamic Programming |
Lecture |
7 |
|
|
8 |
Network Analysis: Minimum Propagation, Shortest Path, and Maximum Flow Problems |
Lecture |
9 |
Project Management: PERT / CPM - Inventory Models |
Lecture |
10 |
Estimation Modeler: Regression Methods, Leveling Methods |
Lecture |
11 |
Game Theory |
Lecture |
12 |
Decision Theory |
Lecture |
13 |
Markov Processes - Queuing Systems: M / M / 1, M / M / s, M / M / |
Lecture |
14 |
|
|
15 |
|
|
16 |
Final Exam |
|