|
Continuation of modern geometric descriptions of polyhedrons. Included are definitions of convex polyhedron, half spaces, hyperplanes, affine dimension, and some connections to Linear Programming.
|
|
Discussion of simplex method with respect to convergence, degeneracy of pivots, pivot rules, and optimality. Improvement of theorems in previous lectures so now we can guarantee that the simplex…
|
|
Phase 1 of simplex method and examples with pivot tools.
|
|
High level overview of the simplex method. A proof of correctness for optimality from the simplex method. Introduction to the two phase simplex method.
|
|
Simplex method computations with a discussion of dictionaries and corresponding solutions.
|
|
Terminology and notation for the simplex method. Dictionaries, basis, slack variables, basic feasible solutions and the relationship between these. Certification of results in terms of the objective…
|
|
Terminology for simplex method is defined in this lecture. This is written is matrix form. Examples are in the following lectures.
|
|
Review of linear algebra in context of solving linear programs.
|
|
MCB-143 Lecture 2023-05-11 at 08:57
|
|
|
|
MCB-143 Lecture 2023-04-13 at 08:57
|
|
|
|
|
|
|
|
|
|
|