02-24-01410 - Non-Linear

and Combinatorial
Optimization

DR. AHMED TAYEL

De p a rtment o f E n gi neering M at h em ati cs a n d P hysi cs, Fa c ul ty o f
E n gi neering , Al exandria Un i ve rsi ty
a h m e d .taye l @ a l ex u . e d u . e g
General overview
02-24-01410 - Non-Linear and Combinatorial Optimization (3 Cr; 2 Lec, 1 P):

• Optimization techniques for constrained unidimensional and multidimensional

problems.
• Analysis techniques, Matching, Unimodular matrices, Matroids, Polyhedral
aspects, Max-flows and min-cuts, Multicommodity flows.
• Heuristic techniques for hard optimization problems.

Pre-requisite(s): 02-24-00101, 02-24-00108.

Data Structures
Linear Algebra
and Algorithms
Course objectives
1. Explore the different techniques of
optimizations.
2. Choose the appropriate optimization technique
to the different optimization problems.
3. Be able to formulate and solve the optimization
problems with constraints to real life problems.
Text books
Main text
Engineering Optimization Theory and Practice, by
Singiresu S. Rao (4th edition).

Combinatorial Optimization Theory and

Algorithms, by Bernard Korte and Jens Vygen (5th
edition).
 Online material
Google drive for lectures and sheets.
https://drive.google.com/drive/folders/1pjjpNIgGWydMSkKX1wsWxpDzzefb_Hfj?usp=sharing

Youtube channel (Lectures available when necessary)

https://www.youtube.com/channel/UC-kLqliSRam_MGW53QsUewg

Other materials
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-252j-nonlinear-programming-spring-2003/
https://ocw.mit.edu/courses/mathematics/18-433-combinatorial-optimization-fall-2003/index.htm
Grading
Year work 50 marks
Final exam 50 marks
Contact information
E-mail
◦ ahmed.tayel@alexu.edu.eg
Dealing with the course
➢ Understand the concepts in lecture as possible.
➢ Complete your understanding using online materials.
➢ Test your understanding with solved examples in the
lecture/textbook.
➢ Practice on as many problems as possible.
Any questions?
BEFORE WE START!