Active/Collaborative Learning Student Teams Integrating Technology Effectively Women and Minorities Assessment and Evaluation EC2000 Emerging Technology Foundation Coalition Curricula Concept Inventories
Linear Programming: Algebraic Approach to the Simplex Algorithm


The main objective of this module is to give the students an insight of the basis of the Simplex algorithm. The module uses the algebraic formulation of the simplex as a way to entice the students to visualize the inner working of the Simplex method. The information acquired in this module will be very valuable as a background material for the topics of sensitivity analysis and duality. 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. It is also recommended that this module is taught after the module entitled .Introduction to the Simplex Algorithm.. 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:

  • Explain the logic behind the algorithmic steps of the Simplex Algorithm
  • Find the optimal solution of a Linear Programming problem by using the algebraic approach of the Simplex Algorithm

  • Student Materials
    HTML / PDF / PPT

    Instructor guide


Related Links:









Partner Links