Fundamentals of the Simplex Method
Fundamentals of the Simplex Method:
The Simplex table is the basis for displaying the duality concepts and performing sensitivity analysis or post-optimal.
In the initial table, the constraint coefficients under the initial variables form an identity matrix (all elements on the main diagonal are 1, and all non-diagonal elements are zero).
With this arrangement, the successive iterations of the Simplex algorithm, generated by the row operations using the Gauss-Jordan method, modify the elements of the identity matrix to produce what is known as the "inverse matrix".
As we shall see, the inverse matrix is the key to compute all elements of the associated simplex table.
See the full lecture (This file is compressed. Therefore, you must install Winzip, winRAR or another compatible decompressor application on your computer.)
The Simplex table is the basis for displaying the duality concepts and performing sensitivity analysis or post-optimal.
In the initial table, the constraint coefficients under the initial variables form an identity matrix (all elements on the main diagonal are 1, and all non-diagonal elements are zero).
With this arrangement, the successive iterations of the Simplex algorithm, generated by the row operations using the Gauss-Jordan method, modify the elements of the identity matrix to produce what is known as the "inverse matrix".
As we shall see, the inverse matrix is the key to compute all elements of the associated simplex table.
See the full lecture (This file is compressed. Therefore, you must install Winzip, winRAR or another compatible decompressor application on your computer.)
Comments
Post a Comment