Optimization Problems with Interval Uncertainty: Branch and Bound Method

  • Authors:

  • I. V. Sergienko;Ol. O. Iemets;Ol. O. Yemets

  • Affiliations:

  • V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

An order on a set of centered intervals is introduced and is proved to be linear. An optimization problem is formulated over a set of centered intervals. The branch and bound method is proposed and substantiated to solve this problem. A number of theorems that substantiate estimates in the branch and bound method are proved.