Revised Simplex method

This is an implementation of the Revised Simplex Method for linear programs.
250 Downloads
Updated 6 Oct 2016

View License

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 (2025). Revised Simplex method (https://se.mathworks.com/matlabcentral/fileexchange/59510-revised-simplex-method), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2014a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Transaction Cost Analysis in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.0.0.0