Abstract
In Lesson 5, we started to show how continuous mathematics can help in algorithm design. In particular, we showed that the problem of finding the best penalty function leads to a linear differential equation. Since other algorithm design problems lead to similar differential equations, we need a general method for solving such differential equations. Such a method is described in this lesson.
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
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Nguyen, H.T., Kreinovich, V. (1997). Solving General Linear Differential Equations with Constant Coefficients: An Application to Constrained Optimization. In: Applications of Continuous Mathematics to Computer Science. Theory and Decision Library, vol 38. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0743-5_6
Download citation
DOI: https://doi.org/10.1007/978-94-017-0743-5_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4901-8
Online ISBN: 978-94-017-0743-5
eBook Packages: Springer Book Archive