Abstract
As was shown in Chapter 6, iterative methods for polyhedral approximation of multi-dimensional convex compact bodies (CCB) play now an important role in real-life applications of the Interactive Decision Maps technique. We have demonstrated in Chapter 7 that such methods can be used for approximating the reachable sets of dynamic systems as well. In addition to the approximation of the feasible criterion sets in multi-criteria decision problems and reachable sets in dynamic problems, methods for polyhedral approximation of CCBs can be applied to mathematical programming (see, for example, Sonnevend, 1977; Vasil’yev, 1983, etc.).
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
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lotov, A.V., Bushenkov, V.A., Kamenev, G.K. (2004). Theory of Iterative Methods for Polyhedral Approximation of Convex Bodies. In: Interactive Decision Maps. Applied Optimization, vol 89. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8851-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8851-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4690-6
Online ISBN: 978-1-4419-8851-5
eBook Packages: Springer Book Archive