IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1026-1047.html
   My bibliography  Save this article

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra

Author

Listed:
  • András Frank

    (MTA-ELTE Egerváry Research Group, Department of Operations Research, Eötvös University, Budapest H-1117, Hungary)

  • Kazuo Murota

    (School of Business Administration, Tokyo Metropolitan University, Tokyo 192-0397, Japan)

Abstract

A min-max formula is proved for the minimum of an integer-valued separable discrete convex function in which the minimum is taken over the set of integral elements of a box total dual integral polyhedron. One variant of the theorem uses the notion of conjugate function (a fundamental concept in nonlinear optimization), but we also provide another version that avoids conjugates, and its spirit is conceptually closer to the standard form of classic min-max theorems in combinatorial optimization. The presented framework provides a unified background for separable convex minimization over the set of integral elements of the intersection of two integral base-polyhedra, submodular flows, L-convex sets, and polyhedra defined by totally unimodular matrices. As an unexpected application, we show how a wide class of inverse combinatorial optimization problems can be covered by this new framework.

Suggested Citation

  • András Frank & Kazuo Murota, 2022. "A Discrete Convex Min-Max Formula for Box-TDI Polyhedra," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1026-1047, May.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1026-1047
    DOI: 10.1287/moor.2021.1160
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1160
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1160?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:2:p:1026-1047. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.