IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v69y2021i5p1396-1408.html
   My bibliography  Save this article

M ♮ -Convexity and Its Applications in Operations

Author

Listed:
  • Xin Chen

    (Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801)

  • Menglong Li

    (Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801)

Abstract

M ♮ -convexity, one of the main concepts in discrete convex analysis, possesses many salient structural properties and allows for the design of efficient algorithms. In this paper, we establish several new fundamental properties of M ♮ -convexity and its variant SSQM ♮ -convexity (semistrictly quasi M ♮ -convexity). We show that in a parametric maximization model, the optimal solution is nonincreasing in the parameters when the objective function is SSQM ♮ -concave and the constraint is a box and illustrate when SSQM ♮ -convexity and M ♮ -convexity are preserved. A sufficient and necessary characterization of twice continuously differentiable M ♮ -convex functions is provided. We then use them to analyze two important operations models: a classical multiproduct dynamic stochastic inventory model and a portfolio contract model where a buyer reserves capacities in blocks from multiple competing suppliers. We illustrate that looking from the lens of M ♮ -convexity allows to simplify the complicated analysis in the literature for each model and extend the results to more general settings.

Suggested Citation

  • Xin Chen & Menglong Li, 2021. "M ♮ -Convexity and Its Applications in Operations," Operations Research, INFORMS, vol. 69(5), pages 1396-1408, September.
    • Handle: RePEc:inm:oropre:v:69:y:2021:i:5:p:1396-1408
    DOI: 10.1287/opre.2020.2070
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2020.2070
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2020.2070?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:oropre:v:69:y:2021:i:5:p:1396-1408. 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.