This course will concentrate on linear programming. Linear programming is perhaps the most widely used optimization tool in the modern world. A linear programming problem is an optimization problem that seeks to maximize or minimize a linear function subject to a system of linear inequality and/or equality constraints. Applications of linear programming are diverse. These include transportation problems, corporate planning, inventory control, game theory, production scheduling, and many others. In the course you will learn how to model real world problems as linear programming problems, and solve them using a method called the simplex method. You will also study the theory behind the simplex method and learn how to carry out sensitivity analysis, that is, analyze how your optimal solution changes if certain parameters of your linear programming problem are altered.
- Lecturer: Xhano Soares