Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:4006909
Jump to:navigation, search

DOI10.1057/jors.1992.22zbMath0751.90047OpenAlexW2072929135MaRDI QIDQ4006909

Danny C. Myers

Publication date: 27 September 1992

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

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


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)


Related Items (2)

A computationally stable solution algorithm for linear programs ⋮ Calibrating cross-training to meet demand mix variation and employee absence







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4006909&oldid=17703836"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 01:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki