logoClassRank

Curtin University

Areas of Study

Advanced Optimisation Techniques 501

  • 6121
  • Semester 1
  • 25.0
Average Rating
Difficulty Level

Linear programming: duality, the dual simplex algorithm, the revised simplex algorithm, decomposition techniques for large scale linear programs. Integer programming: applications, techniques of cutting planes, implicit enumeration and Branch and Bound (BB). Non-linear programming: introduction to basic theory. -- Course Website



Post an anonymous review of this course

Overall experience
Difficulty Level
POST