THE COMPLEXITY OF THE CONSTRAINED GRADIENT METHOD FOR LINEAR PROGRAMMING

J. Telgen

No 272204, Econometric Institute Archives from Erasmus University Rotterdam

Abstract: It is proved that the computation of , the constrained gradient is equivalent (in a coMplexity, theoretic sense), to quadratic programming. Since the *latter is an NP—hard problem, the constrained gradient method is not a 'good' method for linear programming unless P = AT.

Keywords: Agricultural and Food Policy; Research Methods/Statistical Methods (search for similar items in EconPapers)
Pages: 11
Date: 1980
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/272204/files/erasmus131.pdf (application/pdf)
https://ageconsearch.umn.edu/record/272204/files/erasmus131.pdf?subformat=pdfa (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ags:eureia:272204

DOI: 10.22004/ag.econ.272204

Access Statistics for this paper

More papers in Econometric Institute Archives from Erasmus University Rotterdam Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().