|
Introduction
The main objective of this module is to introduce the Simplex algorithm. The main focus of module is on the application of the rules and algebraic manipulations of the Simplex algorithm rather then the reason behind them. Another module of this series will focus on understanding the reason behind the steps followed by the Simplex. The module is intended to be used as a regular lecture in an undergraduate introductory course to Operations Research, or a self-contained support lecture in a undergraduate/graduate course that requires a basic knowledge of linear programming. The background knowledge required for the module is elementary knowledge of analytical geometry and linear algebra. In particular, it is necessary that the student know how to solve a system of linear equations and the general equation of the straight line. The module is designed to make the students active participants in the lecture.s exercises. The module design is tailored for a class that has been divided into teams. The ideal size of the teams is three or four students. However, smaller or larger teams can also be accommodated without any changes to the module.s structure.
Instructional Objectives
At the end of the lecture each student should be able to:
- Express a Linear Programming problem in the standard form
- Set up the simplex tableau for a standard LP problem
- Find the optimal solution for an LP problem using the simplex tableau
Student Materials
HTML / PDF / PPT
Instructor guide
Word / PDF
|
