Problems with uncertainties can be viewed and formalized making use of multifunctions or general set-valued functions. A new concept of global optimality is proposed which allows us to solve global optimization problems with uncertainties, in natural setting without imposing artificial
Global optimization in problems with uncertainties
โ Scribed by Efim A. Galperin
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 317 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
โฆ Synopsis
Problems with uncertainties can be viewed and formalized making use of multifunctions or general set-valued functions which are usually non-differentiable. A new concept of global optimality is proposed which allows us to solve global optimization problems with uncertainties, in natural setting without imposing artificial constraints on uncertainties, nor introducing a kind of partial ordering (in order to apply conventional optimality concepts and optimization techniques), nor considering solution ยซin probabilityยป. With the new concept, deterministic optimization requires two optimization procedures. Preliminary study of the subject is presented with many illustrative examples. Then, a monotonic iterative algorithm is developed which renders approximate solutions with a precision specified in advance. ({ }^{1})
๐ SIMILAR VOLUMES
Given a pair of finite, disjoint sets and in , a fundamental problem with numerous applications is to find a simple function () defined over which separates the sets in the sense that () > 0 for all โ and () < 0 for all โ . This can always be done (e.g., with the piecewise linear function defined by
The models used in the assessment of the effects of global climate change are based on limited knowledge of the fundamental phenomena, for instance, the role of the clouds and of the oceans (IPCC, 1996). Although a general consensus seems to exist among the scientists involved, the very existence of
## Abstract Two novel deterministic global optimization algorithms for nonconvex mixedโinteger problems (MINLPs) are proposed, using the advances of the ฮฑBB algorithm for nonconvex NLPs of Adjiman et al. The special structure mixedโinteger ฮฑBB algorithm (SMINโฮฑBB) addresses problems with nonconvexi