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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A new steepest edge approximation for the simplex method for linear programming

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

DOI10.1023/A:1018317206484zbMath0912.90220MaRDI QIDQ1273430

Artur Świȩtanowski

Publication date: 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

simplex methodsteepest edge approximationsteepest edge pricing


Mathematics Subject Classification ID

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


Related Items (1)

Advances in design and implementation of optimization software


Uses Software

  • KORBX
  • DEVEX






This page was built for publication: A new steepest edge approximation for the simplex method for linear programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1273430&oldid=13374037"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 09:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki