Link to Curtin homepage      CurtinSearch | Curtin Site Index 
Online handbook 2004
CoursesUnitsNew CoursesJoint Uni CoursesDefinition of TermsContact / Help
About Curtin University
Academic calendar
Admissions Information
Applying for a research higher degree
Applying to Curtin
Bookshop
Prospective student service
Curtin scholarships
Enrolment information
Fee Information
Grading system
IT Policy
Student rights and responsibilities
Student policy and procedures
    

6121 (v.5) Advanced Optimisation Techniques 501


 

Area:

Department of Mathematics and Statistics

Credits:

25.0

Contact Hours:

3.0

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.
 

Unit Outcomes:

On successful completion of this unit the student will have gained an understanding of the theory and application of various algorithms to solve a linear programming problems and a good understanding of the methods to solve combinatorial optimization problems.

Texts and references listed below are for your information only and current as of September 30, 2003. Some units taught offshore are modified at selected locations. Please check with the unit coordinator for up-to-date information and approved offshore variations to unit information before finalising study and textbook purchases.

Unit References:

Calvert J.E. and Voxman W.L., 1989, 'Linear Programming', Harcourt Brace Javanovich. Chvatal, V., 1993, 'Linear Programming', Freeman. Garfinkel R.S. and Nemhauser G.L., 1972, 'Integer Programming', Wiley. Hiller F.S. and Lieberman G.T., 1990, 'Introduction to Operations Research', 5th Edition, McGraw-Hill. Murty K.G., 1976, 'Linear and Combinatorial Programming', John Wiley & Sons, New York. Papadimitriou C.H. and Steiglitz K., 1982, 'Combinatorial Optimisation. Algorithms and Complexity', Prentice-Hall. Winston W.L., 1994, 'Operations Research - Applications and Algorithms', Duxbury Press, Wadsworth.

Unit Texts:

No prescribed text.
 

Unit Assessment Breakdown:

Assignments (two) 40%. Final Examination 60%.

Field of Education:

 20300 Information Systems (Narrow Grouping)

HECS Band (if applicable):

2  

Extent to which this unit or thesis utilises online information:

 Informational  

Result Type:

 Grade/Mark


Availability

YearLocationPeriodInternalArea ExternalCentral External
2004Bentley CampusSemester 1Y  

Area
External
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research.
Central
External
refers to external course/units run through the Curtin Bentley-based Distance Education Area

 
Click here for a printable version of this page

    

Picture of sun setting over Henderson Court on Curtin's Bentley Campus

 

Curtin crest