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

The gravitational method for linear programming

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

zbMath0616.90039MaRDI QIDQ1821685

Katta G. Murty

Publication date: 1986

Published in: Opsearch (Search for Journal in Brave)


zbMATH Keywords

gravitational methodinterior point algorithm


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)


Related Items

A regularized simplex method, A gravitational interior point method for LP., A computational study of redundancy in randomly generated polytopes, Complexity of the gravitational method for linear programming, The steepest descent gravitational method for linear programming, Pivot rules for linear programming: A survey on recent theoretical developments



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