IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v80y2021i4d10.1007_s10898-021-01053-8.html
   My bibliography  Save this article

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

Author

Listed:
  • B. G.-Tóth

    (University of Szeged)

  • L. G. Casado

    (University of Almería, CeiA3)

  • E. M. T. Hendrix

    (Universidad de Málaga and Wageningen University)

  • F. Messine

    (University of Toulouse)

Abstract

Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search over the feasible area. One choice is to use simplicial partition sets. Obtaining sharp and cheap bounds of the objective function over a simplex is very important in the construction of efficient Global Optimization B&B algorithms. Although enclosing a simplex in a box implies an overestimation, boxes are more natural when dealing with individual coordinate bounds, and bounding ranges with Interval Arithmetic (IA) is computationally cheap. This paper introduces several linear relaxations using gradient information and Affine Arithmetic and experimentally studies their efficiency compared to traditional lower bounds obtained by natural and centered IA forms and their adaption to simplices. A Global Optimization B&B algorithm with monotonicity test over a simplex is used to compare their efficiency over a set of low dimensional test problems with instances that either have a box constrained search region or where the feasible set is a simplex. Numerical results show that it is possible to obtain tight lower bounds over simplicial subsets.

Suggested Citation

  • B. G.-Tóth & L. G. Casado & E. M. T. Hendrix & F. Messine, 2021. "On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic," Journal of Global Optimization, Springer, vol. 80(4), pages 779-804, August.
    • Handle: RePEc:spr:jglopt:v:80:y:2021:i:4:d:10.1007_s10898-021-01053-8
    DOI: 10.1007/s10898-021-01053-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01053-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-021-01053-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Boglárka G.-Tóth & Eligius M. T. Hendrix & Leocadio G. Casado & Frédéric Messine, 2024. "On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1880-1909, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:80:y:2021:i:4:d:10.1007_s10898-021-01053-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.