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

A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra

Author

Listed:
  • Martijn H. H. Schoot Uiterkamp

    (Department of Econometrics and Operations Research, Tilburg University, 5000 LE Tilburg, Netherlands)

Abstract

Motivated by resource allocation problems (RAPs) in power management applications, we investigate the existence of solutions to optimization problems that simultaneously minimize the class of Schur-convex functions, also called least-majorized elements. For this, we introduce a generalization of majorization and least-majorized elements, called ( a , b )-majorization and least ( a , b )-majorized elements, and characterize the feasible sets of problems that have such elements in terms of base and (bi-)submodular polyhedra. Hereby, we also obtain new characterizations of these polyhedra that extend classical characterizations in terms of optimal greedy algorithms from the 1970s. We discuss the implications of our results for RAPs in power management applications and derive a new characterization of convex cooperative games and new properties of optimal estimators of specific regularized regression problems. In general, our results highlight the combinatorial nature of simultaneously optimizing solutions and provide a theoretical explanation for why such solutions generally do not exist.

Suggested Citation

  • Martijn H. H. Schoot Uiterkamp, 2025. "A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra," Mathematics of Operations Research, INFORMS, vol. 50(1), pages 252-276, February.
    • Handle: RePEc:inm:ormoor:v:50:y:2025:i:1:p:252-276
    DOI: 10.1287/moor.2023.0054
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2023.0054
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2023.0054?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:50:y:2025:i:1:p:252-276. 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.