A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming

DOI10.1057/JORS.1992.22zbMATH Open0751.90047OpenAlexW2072929135MaRDI QIDQ4006909FDOQ4006909

Authors: Danny C. Myers 

Publication date: 27 September 1992

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1992.22

Recommendations

• A constraint selection technique for a class of linear programs
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
• scientific article
• scientific article; zbMATH DE number 4172286
• scientific article; zbMATH DE number 4072707

zbMATH Keywords

constraint selection approachdual simplex implementation

Mathematics Subject Classification ID

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

Cited In (9)

• A computational approach to pivot selection in the LP relaxation of set problems
• A sequential dual simplex algorithm for the linear assignment problem
• Title not available (Why is that?)
• Calibrating cross-training to meet demand mix variation and employee absence
• A constraint selection technique for a class of linear programs
• Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• Title not available (Why is that?)
• A computationally stable solution algorithm for linear programs

This page was built for publication: A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming

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