Geometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910042985332736 |
|---|---|
| author | Mondal, Tapas Ojha, Akshay Kumar Pani, Sabyasachi |
| author_facet | Mondal, Tapas Ojha, Akshay Kumar Pani, Sabyasachi |
| contents | Geometric programming (GP) 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 GP problem are deterministic and accurate. However, in the real-world GP problem, the parameters are frequently inaccurate and ambiguous. This paper investigates the GP problem in an uncertain environment, with the coefficients as triangular and trapezoidal two-fold uncertain variables. In this paper, we introduce uncertain measures in a generalized version and focus on more complicated two-fold uncertainties to propose triangular and trapezoidal two-fold uncertain variables within the context of uncertainty theory. We develop three reduction methods to convert triangular and trapezoidal two-fold uncertain variables into single-fold uncertain variables using optimistic, pessimistic, and expected value criteria. Reduction methods are used to convert the GP problem with two-fold uncertainty into the GP problem with single-fold uncertainty. Furthermore, the chance-constrained uncertain-based framework is used to solve the reduced single-fold uncertain GP problem. Finally, a numerical example is provided to demonstrate the effectiveness of the procedures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_01710 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Geometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions Mondal, Tapas Ojha, Akshay Kumar Pani, Sabyasachi Optimization and Control Geometric programming (GP) 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 GP problem are deterministic and accurate. However, in the real-world GP problem, the parameters are frequently inaccurate and ambiguous. This paper investigates the GP problem in an uncertain environment, with the coefficients as triangular and trapezoidal two-fold uncertain variables. In this paper, we introduce uncertain measures in a generalized version and focus on more complicated two-fold uncertainties to propose triangular and trapezoidal two-fold uncertain variables within the context of uncertainty theory. We develop three reduction methods to convert triangular and trapezoidal two-fold uncertain variables into single-fold uncertain variables using optimistic, pessimistic, and expected value criteria. Reduction methods are used to convert the GP problem with two-fold uncertainty into the GP problem with single-fold uncertainty. Furthermore, the chance-constrained uncertain-based framework is used to solve the reduced single-fold uncertain GP problem. Finally, a numerical example is provided to demonstrate the effectiveness of the procedures. |
| title | Geometric Programming Problems with Triangular and Trapezoidal Two-fold Uncertainty Distributions |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2302.01710 |