IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i2d10.1007_s10898-023-01310-y.html
   My bibliography  Save this article

Local search versus linear programming to detect monotonicity in simplicial branch and bound

Author

Listed:
  • L. G. Casado

    (University of Almería)

  • B. G.-Tóth

    (University of Szeged)

  • E. M. T. Hendrix

    (Universidad de Málaga and Wageningen University)

  • F. Messine

    (University of Toulouse)

Abstract

This study focuses on exhaustive global optimization algorithms over a simplicial feasible set with simplicial partition sets. Bounds on the objective function value and its partial derivative are based on interval automatic differentiation over the interval hull of a simplex. A monotonicity test may be used to decide to either reject a simplicial partition set or to reduce its simplicial dimension to a relative border (at the boundary of the feasible set) facet (or face) by removing one (or more) vertices. A monotonicity test is more complicated for a simplicial sub-set than for a box, because its orientation does not coincide with the components of the gradient. However, one can focus on directional derivatives (DD). In a previous study, we focused on either basic directions, such as centroid to vertex or vertex to vertex directions, or finding the best directional derivative by solving an LP or MIP. The research question of this paper refers to using local search (LS) based sampling of directions from vertex to facet. Results show that most of the monotonic DD found by LP are also found by LS, but with much less computational cost. Notice that finding a monotone direction does not require to find the direction in which a derivative bound is the steepest.

Suggested Citation

  • L. G. Casado & B. G.-Tóth & E. M. T. Hendrix & F. Messine, 2025. "Local search versus linear programming to detect monotonicity in simplicial branch and bound," Journal of Global Optimization, Springer, vol. 91(2), pages 311-330, February.
    • Handle: RePEc:spr:jglopt:v:91:y:2025:i:2:d:10.1007_s10898-023-01310-y
    DOI: 10.1007/s10898-023-01310-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01310-y
    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-023-01310-y?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.

    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:91:y:2025:i:2:d:10.1007_s10898-023-01310-y. 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.