An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems

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.