Abstract
This paper considers two main topics. The first one is a new interval global optimization algorithm, using some symbolic transformations of the optimality conditions. The theory of Groebner bases and the idea of componentwise interval Newton method are used. The second topic is the description of an optimization problem connected with access control to a computer server. This optimization problem is solved by using a new algorithm and, for comparison, by using a classical interval branch-and-bound algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
