ISSN:
1572-9338
Keywords:
Constrained nonlinear optimization
;
sensitivity analysis
;
inclusion function
;
interval arithmetic
;
90C30
;
65K05
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract An algorithm for finding a large feasiblen-dimensional interval for constrained global optimization is presented. Then-dimensional interval is iteratively enlarged about a seed point while maintaining feasibility. An interval subdivision method may be used to check feasibility of the growing box. The resultant feasible interval is constrained to lie within a given level set, thus ensuring it is close to the optimum. The ability to determine such a feasible interval is useful for exploring the neighbourhood of the optimum, and can be practically used in manufacturing considerations. The numerical properties of the algorithm are tested and demonstrated by an example problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02096403
