Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions.

Saved in:
Bibliographic Details
Title: Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions.
Authors: Mondal, Tapas1 (AUTHOR) tm19@iitbbs.ac.in, Ojha, Akshay Kumar1 (AUTHOR), Pani, Sabyasachi1 (AUTHOR)
Source: Journal of Optimization Theory & Applications. Mar2024, Vol. 200 Issue 3, p978-1016. 39p.
Subjects: Geometric programming
Abstract: Geometric programming is a well-known optimization tool for dealing with a wide range of nonlinear optimization and engineering problems. In general, it is assumed that the parameters of a geometric programming problem are deterministic and accurate. However, in the real-world geometric programming problem, the parameters are frequently inaccurate and ambiguous. To tackle the ambiguity, this paper investigates the geometric programming problem in an uncertain environment, with the coefficients as triangular and trapezoidal twofold uncertain variables. In this paper, we introduce uncertain measures in a generalized version and focus on more complicated twofold uncertainties to propose triangular and trapezoidal twofold uncertain variables within the context of uncertainty theory. We develop three reduction methods to convert triangular and trapezoidal twofold uncertain variables into singlefold uncertain variables using optimistic, pessimistic, and expected value criteria. Reduction methods are used to convert the geometric programming problem with twofold uncertainty into the geometric programming problem with singlefold uncertainty. Furthermore, the chance-constrained uncertain-based framework is used to solve the reduced singlefold uncertain geometric programming problem. Finally, a numerical example is provided to demonstrate the effectiveness of the procedures. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Optimization Theory & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 175829393
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mondal%2C+Tapas%22">Mondal, Tapas</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> tm19@iitbbs.ac.in</i><br /><searchLink fieldCode="AR" term="%22Ojha%2C+Akshay+Kumar%22">Ojha, Akshay Kumar</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Pani%2C+Sabyasachi%22">Pani, Sabyasachi</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Optimization+Theory+%26+Applications%22">Journal of Optimization Theory & Applications</searchLink>. Mar2024, Vol. 200 Issue 3, p978-1016. 39p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Geometric+programming%22">Geometric programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Geometric programming is a well-known optimization tool for dealing with a wide range of nonlinear optimization and engineering problems. In general, it is assumed that the parameters of a geometric programming problem are deterministic and accurate. However, in the real-world geometric programming problem, the parameters are frequently inaccurate and ambiguous. To tackle the ambiguity, this paper investigates the geometric programming problem in an uncertain environment, with the coefficients as triangular and trapezoidal twofold uncertain variables. In this paper, we introduce uncertain measures in a generalized version and focus on more complicated twofold uncertainties to propose triangular and trapezoidal twofold uncertain variables within the context of uncertainty theory. We develop three reduction methods to convert triangular and trapezoidal twofold uncertain variables into singlefold uncertain variables using optimistic, pessimistic, and expected value criteria. Reduction methods are used to convert the geometric programming problem with twofold uncertainty into the geometric programming problem with singlefold uncertainty. Furthermore, the chance-constrained uncertain-based framework is used to solve the reduced singlefold uncertain geometric programming problem. Finally, a numerical example is provided to demonstrate the effectiveness of the procedures. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Optimization Theory & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=175829393
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10957-023-02347-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 39
        StartPage: 978
    Subjects:
      – SubjectFull: Geometric programming
        Type: general
    Titles:
      – TitleFull: Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mondal, Tapas
      – PersonEntity:
          Name:
            NameFull: Ojha, Akshay Kumar
      – PersonEntity:
          Name:
            NameFull: Pani, Sabyasachi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 00223239
          Numbering:
            – Type: volume
              Value: 200
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Optimization Theory & Applications
              Type: main
ResultId 1