IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i4p652-d349766.html
   My bibliography  Save this article

Robustness of Interval Monge Matrices in Fuzzy Algebra

Author

Listed:
  • Máté Hireš

    (Department of Computers and Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia)

  • Monika Molnárová

    (Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia)

  • Peter Drotár

    (Department of Computers and Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, 042 00 Košice, Slovakia)

Abstract

Max–min algebra (called also fuzzy algebra) is an extremal algebra with operations maximum and minimum. In this paper, we study the robustness of Monge matrices with inexact data over max–min algebra. A matrix with inexact data (also called interval matrix) is a set of matrices given by a lower bound matrix and an upper bound matrix. An interval Monge matrix is the set of all Monge matrices from an interval matrix with Monge lower and upper bound matrices. There are two possibilities to define the robustness of an interval matrix. First, the possible robustness, if there is at least one robust matrix. Second, universal robustness, if all matrices are robust in the considered set of matrices. We found necessary and sufficient conditions for universal robustness in cases when the lower bound matrix is trivial. Moreover, we proved necessary conditions for possible robustness and equivalent conditions for universal robustness in cases where the lower bound matrix is non-trivial.

Suggested Citation

  • Máté Hireš & Monika Molnárová & Peter Drotár, 2020. "Robustness of Interval Monge Matrices in Fuzzy Algebra," Mathematics, MDPI, vol. 8(4), pages 1-16, April.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:652-:d:349766
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/4/652/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/4/652/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Burkard, Rainer E., 2007. "Monge properties, discrete convexity and applications," European Journal of Operational Research, Elsevier, vol. 176(1), pages 1-14, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexander S. Estes & Michael O. Ball, 2021. "Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 785-807, May.
    2. Akamatsu, Takashi & Wada, Kentaro & Iryo, Takamasa & Hayashi, Shunsuke, 2021. "A new look at departure time choice equilibrium models with heterogeneous users," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 152-182.
    3. Osawa, Minoru & Fu, Haoran & Akamatsu, Takashi, 2018. "First-best dynamic assignment of commuters with endogenous heterogeneities in a corridor network," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 811-831.
    4. F. Javier Martinez de Albeniz & Carles Rafels, 2012. "Monge assignment games," Working Papers in Economics 282, Universitat de Barcelona. Espai de Recerca en Economia.
    5. Qi Feng & Chengzhang Li & Mengshi Lu & Jeyaveerasingam George Shanthikumar, 2022. "Dynamic Substitution for Selling Multiple Products under Supply and Demand Uncertainties," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1645-1662, April.
    6. Akamatsu, Takashi & Wada, Kentaro & Iryo, Takamasa & Hayashi, Shunsuke, 2018. "Departure time choice equilibrium and optimal transport problems," MPRA Paper 90361, University Library of Munich, Germany.
    7. He, Cheng & Lin, Yixun & Yuan, Jinjiang, 2010. "A note on the single machine scheduling to minimize the number of tardy jobs with deadlines," European Journal of Operational Research, Elsevier, vol. 201(3), pages 966-970, March.
    8. Tseytlin, Yulia & Heese, H. Sebastian, 2023. "Inventory allocation with full downward substitution and monotone cost differences," European Journal of Operational Research, Elsevier, vol. 307(1), pages 130-139.
    9. Tseytlin, Yulia & Heese, H. Sebastian, 2019. "Allocation under a general substitution structure," European Journal of Operational Research, Elsevier, vol. 277(2), pages 492-506.
    10. Hildebrandt, Benjamin & Hurink, Johann & Manitz, Michael, 2024. "Local energy management: A base model for the optimization of virtual economic units," Energy Economics, Elsevier, vol. 129(C).

    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:gam:jmathe:v:8:y:2020:i:4:p:652-:d:349766. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.