View Item 

Show simple item record

Computational complexity of parametric linear programming

dc.contributor.authorMurty, Katta G.en_US
dc.date.accessioned2006-09-11T19:32:17Z
dc.date.available2006-09-11T19:32:17Z
dc.date.issued1980-12en_US
dc.identifier.citationMurty, 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.issn1436-4646en_US
dc.identifier.issn0025-5610en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47907
dc.description.abstractWe 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.extent417864 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; The Mathematical Programming Societyen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherNumerical Analysisen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherMathematicsen_US
dc.subject.otherComputational Complexityen_US
dc.subject.otherWorst Case Behavioren_US
dc.subject.otherParametric Linear Programen_US
dc.subject.otherNumerical and Computational Methodsen_US
dc.subject.otherExponential Growthen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherOptimizationen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.titleComputational complexity of parametric linear programmingen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumThe University of Michigan, Ann Arbor, MI, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47907/1/10107_2005_Article_BF01581642.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01581642en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10107_2005_Article_BF01581642.pdf
Size:
408.0KB
Format:
PDF
View/Open

Show simple item record

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.