EP30.FSF1121 — Network and Linear Optimization
Course description
This course introduces fundamental concepts and techniques in Linear Programming and Network Optimization, two core areas of Operations Research. Students learn how to formulate optimization models, analyze feasible regions, and apply the simplex method, duality, and sensitivity analysis to solve linear programs. The course then develops structured optimization methods on networks, including spanning trees, shortest paths, maximum flows, and minimum-cost flows, together with primal and dual network simplex algorithms. Applications cover logistics, transportation, supply chains, and structural design. Practical sessions emphasize building and solving models using computational tools such as Excel Solver and Python. A group project reinforces modelling, analytical reasoning, teamwork, and technical communication skills.
Course requirements
Requirements for taking final /terminal exams
Students are allowed to take the final exam if their attendance score reaches 5 points or more (on the scale of 10).
Requirements for attending classes
Students are responsible for attending all classes. In case of absence from school due to force majeure reasons, sufficient and reasonable proofs must be provided. For each absence, 1 point will be deducted 1 point. Students who miss any classes more than 3 times, with or without reason, will be considered as failing to complete the course and have to re-register.
Students will be awarded points for constructive comments, these points are added to attendance points and group assignments.
Groups who do not submit the group work will receive a score of 0 (zero). Late submissions will be deducted for each day of late submission.
Requirements for in-class behaviour
The course is conducted on the principle of respecting learners and lecturers. Any behaviour that affects the teaching and learning process is strictly prohibited.
Students must come to class on time. Students who are late more than 10 minutes after class starts will not be allowed to attend the class. Do not make noise and affect others during the learning process.
Laptops and tablets are only used for the purpose of taking notes for and calculating for lectures and exercises, absolutely forbidden to use for other purposes.
Detailed content
The course content includes
- Introduction to Linear Programming
- Simplex Method I
- Degeneracy, Cycling, and Anti-Cycling Rules
- Duality Theory
- Network Optimization Introduction & Spanning Trees
- Network Simplex
- Applications
- Structural Optimization
Lecturers
- Nguyen Van Quy
- Le Thi Anh
- Phung Minh Duc
- Bui Quoc Hoan
- Tong Thanh Trung
Teaching plan
Week 1
Week 2
Learning resources
- Linear Programming: Foundations and Extensions. Second Edition. Springer — Vanderbei, R. J., 2001
- Linear Optimization in Applications — S. L. Tang, Hong Kong UP, 1999
- Network Optimization: Continuous and Discrete Models — Bertsekas & Tsitsiklis, 1998
- Network Optimization Problems: Algorithms — Du & Pardalos, Applications and Complexity, 1993
- Lecture notes and slides