In Chapter 2 we saw an algorithm that computed the volume of a convex polytope. With obvious ad hoc modifications, it can be used to solve the integration problem I (see Section 2.4). We qualified this method of dual and even defined a dual integration problem I * in (2.13). In this chapter we are now concerned with a comparison between problems P and I from a duality point of view.
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
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Lasserre, JB. (2009). Comparing the Continuous Problems P and I. In: Linear and Integer Programming vs Linear Integration and Counting. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09414-4_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-09414-4_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-09413-7
Online ISBN: 978-0-387-09414-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)