Courses Handbook 2007 - [ Archived ]

6121 (v.5) Advanced Optimisation Techniques 501


Area:

Department of Mathematics and Statistics

Credits:

25.0

Contact Hours:

3.0
 
** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. **
 

Lecture:

3 x 1 Hours Weekly
 

Syllabus:

Linear programming - duality, the dual simplex algorithm, the revised simplex algorithm, decomposition techniques for large scale LPs. Integer programming - applications, techniques of cutting planes, implicit enumeration and Branch and Bound. Non-linear programming - introduction to basic theory.
 
** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. **
 

Field of Education:

020305 Systems Analysis and Design

Funding Cluster:

06 - Computing, Built Environment, Health

SOLT (Online) Definitions*:

Informational
*Extent to which this unit or thesis utilises online information

Result Type:

Grade/Mark

Availability

Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information.

 
Curtin Search Curtin Site Index