302366 (v.2) Advanced Optimisation Techniques 401



 

Area:Department of Mathematics and Statistics
Contact Hours:3.0
Credits:25.0
Lecture:3 x 1 Hours Weekly
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.
YearLocationPeriodInternalArea ExternalCentral External
2003Bentley CampusSemester 1Y  

 

Copyright and Disclaimer
Current as of: October 30, 2003     13:11:55
CRICOS provider code 00301J