For a copy of this paper, either

• view a full text copy of this paper

or contact
• Jens Clausen

We consider the problem of optimizing a Lipshitzian function. A new version of the Branch and Bound technique, based on covering by simplexes, is proposed. The convergence of the algorithm is proved. A two dimensional version is implemented, and numerical results are presented.

Last modified Jan. 13, 1999