Upon completion of the course, the PhD-student shall be able to:
• frame a practical problem in to the general class of OR problems and within a decision framework,
• represent a practical problem as a linear programming problem,
• represent a practical problem as an integer programming problem,
• implement algorithms to solve linear and integer programming problems,
• classify problems into complexity classes according to the computational resources required to solve them exactly,
• identify and implement approximate (heuristic and stochastic) solution methods for attacking computationally intractable problems.
If you are interested in courses we offer at the doctoral level, please contact Märet Brunnstedt, Coordinator, Doctoral Studies.
