Syllabus

1. Graph Theory as a mobilisation tool
   • Path and Chains
   • Shortest path
   • Convexity
   • Stability
   • Coloring
2. Linear programming
   • Fundamental concepts
   • Geometrical method
   • Simplex Methods

3. Duality and Sensitivity Analysis.

4. Non linear Programming
   • Introduction.
   • Non constrained problems
   • Constraints programming.