Extreme point characterizations for infinite network flow problems
dc.contributor.author | Romeijn, H. Edwin | en_US |
dc.contributor.author | Sharma, Dushyant | en_US |
dc.contributor.author | Smith, Robert L. | en_US |
dc.date.accessioned | 2007-09-20T17:41:46Z | |
dc.date.available | 2008-01-03T16:19:21Z | en_US |
dc.date.issued | 2006-12 | en_US |
dc.identifier.citation | Romeijn, H. Edwin; Sharma, Dushyant; Smith, Robert L. (2006). "Extreme point characterizations for infinite network flow problems." Networks 48(4): 209-222. <http://hdl.handle.net/2027.42/55830> | en_US |
dc.identifier.issn | 0028-3045 | en_US |
dc.identifier.issn | 1097-0037 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/55830 | |
dc.description.abstract | We study capacitated network flow problems with demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets, because these are equivalent to the problem of finding a shortest path in an infinite directed network. We derive necessary and sufficient conditions for flows to be extreme points of the set of feasible flows. Under an additional regularity condition met by all such problems with integer data, we show that a feasible solution is an extreme point if and only if it contains neither a cycle nor a doubly-infinite path consisting of free arcs (an arc is free if its flow is strictly between its upper and lower bounds). We employ this result to show that the extreme points can be characterized by specifying a basis. Moreover, we establish the integrality of extreme point flows whenever node demands and arc capacities are integer valued. We illustrate our results with an application to an infinite horizon economic lot-sizing problem. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(4), 209–222 2006 | en_US |
dc.format.extent | 405618 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.publisher | Wiley Subscription Services, Inc., A Wiley Company | en_US |
dc.subject.other | Engineering | en_US |
dc.subject.other | Electronic, Electrical & Telecommunications Engineering | en_US |
dc.title | Extreme point characterizations for infinite network flow problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2117 | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2117 | en_US |
dc.contributor.affiliationother | Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, P.O. Box 116595, Gainesville, Florida 32611-6595 ; Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, P.O. Box 116595, Gainesville, Florida 32611-6595 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/55830/1/20134_ftp.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1002/net.20134 | en_US |
dc.identifier.source | Networks | 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.