scientific article; zbMATH DE number 522740

MaRDI QIDQ4284155zbMATH OpenFDO

Authors Nicholas Beaumont

Publication date 12 June 1994

zbMATH Keywords

dual variable boundssimplex method

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05)

Recommendations

• A note on dual simplex algorithm for linear programming problem with bounded variables
• Dual simplex algorithm with implicit representation of variable upper bounds
• A practical guide to the dual theorem
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• scientific article; zbMATH DE number 1069803

Cited in

(5)

• scientific article; zbMATH DE number 1501789 (Why is no real title available?)
• Dual simplex algorithm with implicit representation of variable upper bounds
• Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
• A note on dual simplex algorithm for linear programming problem with bounded variables
• A practical guide to the dual theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284155)