Computational complexity of parametric linear programming
dc.contributor.author | Murty, Katta G. | en_US |
dc.date.accessioned | 2006-09-11T19:32:17Z | |
dc.date.available | 2006-09-11T19:32:17Z | |
dc.date.issued | 1980-12 | en_US |
dc.identifier.citation | Murty, Katta G.; (1980). "Computational complexity of parametric linear programming." Mathematical Programming 19(1): 213-219. <http://hdl.handle.net/2027.42/47907> | en_US |
dc.identifier.issn | 1436-4646 | en_US |
dc.identifier.issn | 0025-5610 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47907 | |
dc.description.abstract | We establish that in the worst case, the computational effort required for solving a parametric linear program is not bounded above by a polynomial in the size of the problem. | en_US |
dc.format.extent | 417864 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; The Mathematical Programming Society | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Numerical Analysis | en_US |
dc.subject.other | Mathematics of Computing | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Computational Complexity | en_US |
dc.subject.other | Worst Case Behavior | en_US |
dc.subject.other | Parametric Linear Program | en_US |
dc.subject.other | Numerical and Computational Methods | en_US |
dc.subject.other | Exponential Growth | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Mathematical Methods in Physics | en_US |
dc.title | Computational complexity of parametric linear programming | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | The University of Michigan, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47907/1/10107_2005_Article_BF01581642.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01581642 | en_US |
dc.identifier.source | Mathematical Programming | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.