ویراساینس.
مقاله

Solving fully linear programming problem based on Z-numbers

M. Joghataee, T. Allahviranloo, F. Hosseinzadeh Lotfi, A. Ebrahimnejad, S. Abbasbandy, A. Amirteimoori, M. Catak

چکیده

Generally exploring the exact solution of linear programming problems in which all variables and parameters are Z-numbers, is either not possible or difficult. Therefore, a few numerical methods to find the numerical solutions do act an important role in these problems. In this paper, we concentrate on introducing a new numerical method to solve such problems based on the ranking function. After proving the necessary theories, for more illustrations and the correctness of the topic, some theoretical and practical examples are also provided. Finally, the results obtained from the proposed method have been compared with some existing methods.

شکل‌ها (۶)

  • شکل، صفحه‌ی ۱
    صفحه‌ی ۱
  • Figure 1: ZA: Constraint component of Z function, and ZB: The reliability (certainty) of ZA for Example 4.1
    Figure 1: ZA: Constraint component of Z function, and ZB: The reliability (certainty) of ZA for Example 4.1صفحه‌ی ۱۲
  • Figure 2: Z = (ZA, ZB) for Example 4.1
    Figure 2: Z = (ZA, ZB) for Example 4.1صفحه‌ی ۱۳
  • Figure 3: ZA: Constraint component of Z function, and ZB: The reliability (certainty) of ZA for Example 4.2
    Figure 3: ZA: Constraint component of Z function, and ZB: The reliability (certainty) of ZA for Example 4.2صفحه‌ی ۱۵
  • Figure 3: ZA: Constraint component of Z function, and ZB: The reliability (certainty) of ZA for Example 4.2
    Figure 3: ZA: Constraint component of Z function, and ZB: The reliability (certainty) of ZA for Example 4.2صفحه‌ی ۱۵
  • Figure 5: Z = (ZA, ZB) for Example 4.3
    Figure 5: Z = (ZA, ZB) for Example 4.3صفحه‌ی ۱۷

شکل‌ها از متن کامل مقاله برداشته شده‌اند و حقوقشان از آنِ نویسندگان و ناشر است. منبع: صفحه‌ی اصلی مقاله

اسناد مشابه