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

Z-Number-Based Maximum Expected Linear Programming Model with Applications

Author

Listed:
  • Meng Yuan

    (School of Qian Weichang, Shanghai University, Shanghai 200444, China)

  • Biao Zeng

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Jiayu Chen

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Chenxu Wang

    (School of Computer Science and Engineering, Tianjin University of Technology, Tianjin 300384, China)

Abstract

In research of a better description for information uncertainty, Z-numbers, which are related to both the objective information and the subjective criticism, were first conceptualized by Zadeh. Because of its neologism, there have been multitudinous attempts toward continuation and expansion of the prototype. In this paper, we mainly study varieties of theoretical preparations for classical Z-numbers and derive the maximum expected linear programming model of Z-numbers, which are constructed on the basis of reliability conversion factors and proliferation on applications due to their simplicity. Firstly, by means of transforming Z-numbers into LR fuzzy intervals through their reliability variable, the credibility distribution and inverse distribution of converted Z-numbers are stated precisely. Then, the operational law of independent variables and its expected value can be derived via credibility distribution. The maximum expected Z-number linear programming model is determined on the basis of previous theoretical preparations, and it transforms from a classical Z-number chance-constrained model into a crisp one. Finally, with the aim of improving the programming method, its application in pragmatic practice with the realistic examples of a supplier section and optimal portfolio problems are enumerated to interpret the effectiveness of our model.

Suggested Citation

  • Meng Yuan & Biao Zeng & Jiayu Chen & Chenxu Wang, 2023. "Z-Number-Based Maximum Expected Linear Programming Model with Applications," Mathematics, MDPI, vol. 11(17), pages 1-24, August.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:17:p:3750-:d:1229972
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/17/3750/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/17/3750/
    Download Restriction: no
    ---><---

    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:11:y:2023:i:17:p:3750-:d:1229972. 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: 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.