Revised Simplex method
This is an implementation of the Revised Simplex Method for linear programs.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This method print the iteration, actual base, number of variables in the base,the columns outside the basis. and the reduced cost. Theoreticaly it should work with degenerate basi solutions.
It do not work with games theory problens
There are 3 cases. if the problem is with <= constrains, the boolean variables are menorigual=1, igual=0 and A and C should consider the slack variables. if the problem is with = constrains, then the boolean variables are menorigual=0, igual=1. if the problem is with >= constrains, the boolean variables are menorigual=0, igual=0. A and C should consider the surplus variables
Cite As
Luis Alfredo Avendaño Muñoz (2026). Revised Simplex method (https://www.mathworks.com/matlabcentral/fileexchange/59510-revised-simplex-method), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (7.83 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
