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

On the Performance of Karmarkar's Algorithm

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

DOI10.1057/jors.1988.43zbMath0641.90053OpenAlexW2002477935MaRDI QIDQ3783069

Michael C. Ferris, Andy B. Philpott

Publication date: 1988

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

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

zbMATH Keywords

interior-point methodnumerical experimentspolynomial-time algorithmKarmarkar's algorithmrescaling of the variablessparse matrix manipulations


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)


Related Items

Solving a linear multiperiod portfolio problem by interior-point methodology, On the improvement per iteration in Karmarkar's algorithm for linear programming



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