The simplex method uses a traditional, full-tableau implementation of Dantzig's simplex algorithm , (not the Nelder-Mead simplex). This algorithm is included for backwards compatibility and educational purposes.
versionadded
Simplex method for linear programming
Simplex method for linear programming
The simplex method uses a traditional, full-tableau implementation of Dantzig's simplex algorithm , (not the Nelder-Mead simplex). This algorithm is included for backwards compatibility and educational purposes.
versionadded
The simplex method may encounter numerical difficulties when pivot values are close to the specified tolerance. If encountered try remove any redundant constraints, change the pivot strategy to Bland's rule or increase the tolerance value.
Alternatively, more robust methods maybe be used. See 'interior-point' <optimize.linprog-interior-point>
and 'revised simplex' <optimize.linprog-revised_simplex>
.
<Unimplemented 'footnote' '.. [1] Dantzig, George B., Linear programming and extensions. Rand\n Corporation Research Study Princeton Univ. Press, Princeton, NJ,\n 1963'>
<Unimplemented 'footnote' '.. [2] Hillier, S.H. and Lieberman, G.J. (1995), "Introduction to\n Mathematical Programming", McGraw-Hill, Chapter 4.'>
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them