Abstract
This chapter is of introductory character: it considers various statements of the global optimization problem, the most commonly used types of prior information concerning the objective function and the feasible region, the main solution approaches, several classes of practical problems, and an algorithm comparison dilemma.
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
Editor information
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zhigljavsky, A.A., Pintér, J. (1991). Global Optimization Theory: General Concepts. In: Pintér, J. (eds) Theory of Global Random Search. Mathematics and Its Applications (Soviet Series), vol 65. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3436-1_1
Download citation
DOI: https://doi.org/10.1007/978-94-011-3436-1_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5519-2
Online ISBN: 978-94-011-3436-1
eBook Packages: Springer Book Archive