Abstract
Consider a global optimization problem in which the objective function and/or the constraints are expressed in terms of parameters. Suppose we wish to know the set of global solutions as the parameters vary over given intervals. In this paper we discuss procedures using interval analysis for computing guaranteed bounds on the solution set. This provides a means for doing a sensitivity analysis or simply bounding the effect of errors in data.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
