Dimitri Watel

OPERATIONS RESEARCH

Other teacher(s) : Mahdi Moeini, Vincent Fagnon

In this course, we teach some classical problems and techniques of operations research so that the students are able to recognize an RO problem and to produce a solution to solve it. We particularly teach them the basics of mathematical programming.

Courses

  1. Dynamic programming
  2. Production planning
  3. Maximum flow problem
  4. Branch and bound
  5. Primal methods
  6. Penalty and Barrier Methods
  7. Markov chains
  8. Queuing

Minimaterials

  1. Dynamic programming
  2. Production planning
  3. Maximum flow problem
  4. Branch and bound
  5. Primal methods
  6. Penalty and Barrier Methods
  7. Markov chains
  8. Queuing

Ressouces

  1. Drawings from chapter 1
  2. Flow drawings
  3. Branch and bound for Set Cover
  4. Branch and bound for MAX-2-Sat
  5. Explanations Drawing for the Projected Gradient algorithm

Tutorials

  1. Modelization (Correction)
  2. Dynamic programming (Correction)
  3. Shortest paths (Correction)
  4. Production planning (Correction)
  5. Maximum flow problem (Correction)
  6. Branch and bound (Correction)
  7. Projected gradient (Correction)
  8. Reduced gradient (Correction)
  9. Penalty and Barrier Methods (Correction)
  10. Markov chains (Correction)
  11. Queuing (Correction)

Multiple-choice questionnaire

  1. Dynamic programming (Correction)
  2. Production planning (Correction)
  3. Maximum flow problem (Correction)
  4. Branch and bound (Correction)
  5. Projected gradient (Correction)
  6. Reduced gradient (Correction)
  7. Penalty and Barrier Methods (Correction)
  8. Markov chains (Correction)
  9. Queuing (Correction)
Change language : Français English