Upon completion of this course the student is able to:
- apply the simplex method;
- explain the concept of basic feasible solutions and duality;
- model optimization problems as Linear Programs and can explain how these can be solved.
This course code is only for repeat students who need to re-take the exam from last year.
All others: please refer to the new AM module 2 Structures and Systems 202200235 .
Since the 1940s Linear Programming is used in Operations Research to maximize profits in large companies. The simplex algorithm is one of the most used methods to solve linear programs. Interestingly, it practically outperforms many algorithms that are theoretically superior. In this course, students learn how to model optimization problems as linear programs, and how to solve these using the simplex method. But the main focus is on understanding the fundamental concepts underlying linear programs and the simplex method, including convexity, basic feasible solutions, degeneracy and duality.