Postgraduate Course: Fundamentals of Optimization (MATH11111)
|School||School of Mathematics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 11 (Postgraduate)
||Availability||Available to all students
|Summary||Convexity; Linear Programming: model formulation, simplex method (SM): tableau form, revised SM, geometric interpretation, sensitivity analysis; Extensions and applications of LP: goal programming, data envelopment analysis (DEA), network optimization problems, piecewise linear objective, cutting plane methods; Duality in LP, Lagrangian Relaxation; Solving LP problems using commercial mathematical programming software; Public domain software for optimization, NEOS.
Entry Requirements (not applicable to Visiting Students)
|| Students MUST have passed:
||Other requirements|| None
Information for Visiting Students
|High Demand Course?
Course Delivery Information
|Academic year 2017/18, Not available to visiting students (SS1)
|Course Start Date
|Learning and Teaching activities (Further Info)
Lecture Hours 22,
Seminar/Tutorial Hours 12,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (Assessment)
||See 'Breakdown of Assessment Methods' and 'Additional Notes', above.
||Hours & Minutes
|Main Exam Diet S1 (December)||MATH11111 Fundamentals of Optimization||2:00|
| Knowledge of basic optimization techniques. Ability to formulate decision problems as optimization problems. Ability to solve simple problems and to use the right software to solve complicated problems.
|Course organiser||Prof Jacek Gondzio
Tel: (0131 6)50 8574
|Course secretary||Mrs Frances Reid
Tel: (0131 6)50 4883