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

Affine geometric method for linear programs

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

DOI10.1023/A:1025601511684zbMath0907.90203OpenAlexW1588383772MaRDI QIDQ1267584

Hossein Arsham

Publication date: 13 October 1998

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025601511684


zbMATH Keywords

affine geometryalgebraic (simplex) methodthree-phase algebraic method


Mathematics Subject Classification ID

Linear programming (90C05)


Related Items (7)

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ A computationally stable solution algorithm for linear programs ⋮ An algorithm for simplex tableau reduction: The push-to-pull solution strategy ⋮ Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. ⋮ A validation and verification tool for global optimization solvers ⋮ A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method ⋮ Linearly constrained global optimization: a general solution algorithm with applications.




This page was built for publication: Affine geometric method for linear programs

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