Linear Programming and Networks

Course aim

To introduce students to concepts and applications of modelling operations research based problems and the techniques of linear and integer programming and networks in their solution.

Course content

Modelling in Operations Research. Linear optimisation models and their solution by software, Solution to LP problems; geometry, simplex, sensitivity, duality. Solution to IP problems; geometry, branch and bound. Network models; transportation; assignment, shortest path.

Textbook(s)

Taha, HA 2011, Operations Research: An Introduction, 9th, Prentice Hall, -

Prerequisite(s)

Corequisite(s)

Nil

Teaching method

Note: These components may or may not be scheduled in every study period. Please refer to the timetable for further details.

Assessment

Assignment, Examination, Project

Fees

EFTSL*: 0.125
Commonwealth Supported program (Band 2)
To determine the fee for this course as part of a Commonwealth Supported program, go to:
How to determine your Commonwealth Supported course fee. (Opens new window)

Fee-paying program for domestic and international students
International students and students undertaking this course as part of a postgraduate fee paying program must refer to the relevant program home page to determine the cost for undertaking this course.

Non-award enrolment
Non-award tuition fees are set by the university. To determine the cost of this course, go to:
How to determine the relevant non award tuition fee. (Opens new window)

Not all courses are available on all of the above bases, and students must check to ensure that they are permitted to enrol in a particular course.

* Equivalent Full Time Study Load. Please note: all EFTSL values are published and calculated at ten decimal places. Values are displayed to three decimal places for ease of interpretation.