Skip to main content

Linear Programming – Operational Research

1. Introduction to Linear Programming.

2. Operational Research: Objectives, Aims, Background, Applications.

3. Geometrical Solutions of Linear Programming Problems.

4. Normal Form.

5. Simplex method.

6. Applications of Linear Programming.

7. Least path – Bellman Rule – Applications.

8. Introduction to Dynamic Programming.

9. Applications of Dynamic Programming.

Semester
Spring
Κατεύθυνση
3η κατεύθυνση
Course Code
SAG_EC003
Lectures
3
Coaching
0
Laboratory
0
ECTS
5,0
Factor
1,5
Credits
3