Linear Programming Solver (Simplex)
Linear Programming Solver (Simplex): a planned Super Calculator tool. Covers objective coefficients, constraint matrix and bounds and constraint senses.
Linear Programming Solver (Simplex) is a planned calculator in the mathematics section of Super Calculator, covering linear algebra.
What this calculator will compute
Inputs: objective coefficients, constraint matrix and bounds, constraint senses, optimization direction and integer restriction.
Outputs: optimal solution vector, objective value, binding constraints, shadow prices, slack per constraint and sensitivity ranges.
Formula, recorded as scope and not yet verified against a primary source: Maximize or minimize c’x subject to Ax no greater than b and x no less than zero, solved by the simplex method over the tableau with Bland’s rule to prevent cycling. The dual problem gives shadow prices on each constraint.
Status
This page is a stub. The calculator is not built, no figure on this page has been verified against the authority that sets it, and nothing here should be used to make a decision. The page exists so that the site structure is complete and so that articles can link this concept on first mention.
The stub carries noindex, nofollow and is excluded from the sitemap.