Subject description
This subject covers linear and quadratic programming models, the simplex algorithm, duality and sensitivity, transportation and network flow problems, integer programming, the branch-and-bound algorithm, shortest path problems, Dijkstra's algorithm, unconstrained and constrained optimisation, Karush-Kuhn-Tucker conditions.
Enrolment rules
Pre-Requisite
Equivalence
MATH818 - Optimisation and Applications (Enhanced)
Delivery
To view information specific to your campus, click on Select availability in the top right of screen and choose from the campus, delivery mode and session options.
Teaching staff
Subject coordinators
Engagement hours
Contact Hours:1 x 2 hour lecture, 1 x 1 hour lecture per week
Assessment details
Assignments
Mid-session exam
End of Session Exam
Work integrated learning
Applied WIL:This subject has "Applied WIL". Students in this subject will experience both coursework and a work-related opportunity that typically includes interaction and feedback with industry.
Textbook information
No prescribed textbooks for this subject.
Contact details
Faculty contact