Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Download full text from publisher
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Freund, Robert Michael., 1989. "A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"," Working papers 3079-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
More about this item
KeywordsHD28 .M414 no.2048-; 88;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2207. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann). General contact details of provider: http://edirc.repec.org/data/ssmitus.html .
We have no references for this item. You can help adding them by using this form .