Course Details
Course Information Package
Course Unit Title | INTRODUCTION TO OPTIMIZATION METHODS AND APPLICATIONS | ||||||||
Course Unit Code | AEEE434 | ||||||||
Course Unit Details | |||||||||
Number of ECTS credits allocated | 5 | ||||||||
Learning Outcomes of the course unit | By the end of the course, the students should be able to:
| ||||||||
Mode of Delivery | Face-to-face | ||||||||
Prerequisites | AMAT314 | Co-requisites | NONE | ||||||
Recommended optional program components | NONE | ||||||||
Course Contents | · Linear Programming: The standard form of the linear programming problem, slack variables, the manufacturing problem, the transportation problem, the routing problem, the scheduling problem, revision on linear algebra, linear dependence, Gaussian elimination, existence and uniqueness of optimal solutions, extreme points, vertices, basic solutions, basic feasible solutions and degeneracy, the fundamental theorem of linear programming. · The Simplex Method: The full tableau implementation of the simplex method. · Duality: Transformation of primal linear programming problems into the dual problems. The duality theorem, simplex multipliers, sensitivity and complementary slackness. The dual simplex method. · Practical Optimization Problems: The assignment problem, the transportation problem, the minimum-cost flow problem and the maximal flow problem. · Unconstrained Non-Linear Programming: The standard form of the nonlinear programming problem, convexity, existence and uniqueness of optimal solutions, necessary and sufficient conditions for optimality, gradient methods, steepest descent method, Newton’s method, least squares problem, curve fitting, adaptive control, neural networks. · Constrained Non-Linear Programming: Existence and uniqueness of optimal solutions, necessary and sufficient conditions for optimality, Conditional gradient methods. | ||||||||
Recommended and/or required reading: | |||||||||
Textbooks |
| ||||||||
References |
| ||||||||
Planned learning activities and teaching methods | · Students are taught the course through lectures (3 hours per week) in classrooms or lectures theatres, by means of traditional tools or using computer demonstration.
· Auditory exercises, where examples regarding matter represented at the lectures, are solved and further, questions related to particular open-ended topic issues are compiled by the students and answered, during the lecture or assigned as homework.
· Topic notes are compiled by students, during the lecture which serve to cover the main issues under consideration and can also be downloaded from the lecturer’s webpage. Students are also advised to use the subject’s textbook or reference books for further reading and practice in solving related exercises. Tutorial problems are also submitted as homework and these are solved during lectures or privately during lecturer’s office hours. Further literature search is encouraged by assigning students to identify a specific problem related to some issue, gather relevant scientific information about how others have addressed the problem and report this information in written or orally.
· Students are assessed continuously and their knowledge is checked through tests with their assessment weight, date and time being set at the beginning of the semester via the course outline.
· Students are prepared for final exam, by revision on the matter taught, problem solving and concept testing and are also trained to be able to deal with time constraints and revision timetable.
· The final assessment of the students is formative and summative and is assured to comply with the subject’s expected learning outcomes and the quality of the course.
| ||||||||
Assessment methods and criteria |
| ||||||||
Language of instruction | English | ||||||||
Work placement(s) | NO |