Abstract
The D L P algorithm applies dantzig-Wolfe decomposition to the equivalent linear program (7.10) of the previous chapter, and exploits substantial simplifications that arise from the special structure in this linear program, in particular, from the network specification of the decision alternatives. It circumvents having to generate all decision alternatives (paths in the networks) explicitly, working instead directly on the D L P networks and extracting paths as needed. We emphasize again that the quivalent linear program (7.10) is not generated explicitly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nazareth, J.L. (2001). The D L P Algorithm. In: DLP and Extensions. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56761-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-56761-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62502-2
Online ISBN: 978-3-642-56761-2
eBook Packages: Springer Book Archive