Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

The Simplex Algorithm

In course

MGT-483: Optimal decision making

This course introduces the theory and applications of optimization. We develop tools and concepts of optimization and decision analysis that enable managers in manufacturing, service operations, marketing, transportation and finance to transform data into ...

Description

This lecture covers the Simplex Algorithm, focusing on computing reduced costs, determining optimality, unbounded costs, and degenerate problems. It explains the process of updating the basis, pivot columns, and rows, as well as interpreting the tableau and maintaining feasibility. The instructor demonstrates the algorithm through examples, showcasing the steps involved in finding an initial BFS and efficiently computing the basis matrix. The lecture concludes with a discussion on termination conditions and the importance of maintaining a feasible set throughout the algorithm.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Daniel Kuhn

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Pivot element

The pivot or pivot element is the element of a matrix, or an array, which is selected first by an algorithm (e.g. Gaussian elimination, simplex algorithm, etc.), to do certain calculations. In the case of matrix algorithms, a pivot entry is usually required to be at least distinct from zero, and often distant from it; in this case finding this element is called pivoting. Pivoting may be followed by an interchange of rows or columns to bring the pivot to a fixed position and allow the algorithm to proceed successfully, and possibly to reduce round-off error.

Row and column spaces

In linear algebra, the column space (also called the range or ) of a matrix A is the span (set of all possible linear combinations) of its column vectors. The column space of a matrix is the or range of the corresponding matrix transformation. Let be a field. The column space of an m × n matrix with components from is a linear subspace of the m-space . The dimension of the column space is called the rank of the matrix and is at most min(m, n). A definition for matrices over a ring is also possible.

Simplex algorithm

In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones, and these become proper simplices with an additional constraint. The simplicial cones in question are the corners (i.e., the neighborhoods of the vertices) of a geometric object called a polytope.

Row echelon form

In linear algebra, a matrix is in echelon form if it has the shape resulting from a Gaussian elimination. A matrix being in row echelon form means that Gaussian elimination has operated on the rows, and column echelon form means that Gaussian elimination has operated on the columns. In other words, a matrix is in column echelon form if its transpose is in row echelon form. Therefore, only row echelon forms are considered in the remainder of this article. The similar properties of column echelon form are easily deduced by transposing all the matrices.

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

Related lectures (47)

Matrix Row Rank and Column Rank MOOC: Linear Algebra (Part 1)

Explores the equality of row spaces for equivalent row matrices and the determination of row ranks.

Linear Algebra: Reduction of Linear Application

Covers the reduction of a linear application and finding corresponding reduced forms and bases.

Row-echelon and reduced row-echelon matrices MOOC: Warm-up for EPFL MOOC: Linear Algebra (Part 1)

Explains row-echelon and reduced row-echelon matrices and their role in simplifying system resolution.

Matrix Operations: Rank and Inclusion in Vector Spaces MOOC: Linear Algebra (Part 2)

Explores matrix rank and vector space inclusion through elementary row operations.

Linear Independence and Basis