Show simple item record

A Lagrangian algorithm for the parallel replacement problem with capital rationing constraints

dc.contributor.authorKarabakal, Nejat.en_US
dc.contributor.authorLohmann, Jack R.en_US
dc.contributor.authorBean, James C.en_US
dc.date.accessioned2006-02-03T18:24:04Z
dc.date.available2006-02-03T18:24:04Z
dc.date.issued1992en_US
dc.identifierUMR4751en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/5867
dc.format.extent40 bytes
dc.format.extent59610 bytes
dc.format.extent3366 bytes
dc.format.extent68067 bytes
dc.format.extent2793451 bytes
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.subjectReplacement of industrial equipment -- Mathematical models.en_US
dc.subjectCapital investments -- Mathematical models.en_US
dc.subjectAlgorithms.en_US
dc.subjectLagrangian functions.en_US
dc.subjectInteger programming.en_US
dc.titleA Lagrangian algorithm for the parallel replacement problem with capital rationing constraintsen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/5867/5/ban5838.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/5867/4/ban5838.0001.001.txten_US
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

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.