In this research, stochastic geometric programming with jointchanceconstraints is investigated with elliptically distributed random parameters. The constraint's random coefficient vectors are considered dependen...
详细信息
In this research, stochastic geometric programming with jointchanceconstraints is investigated with elliptically distributed random parameters. The constraint's random coefficient vectors are considered dependent, and the dependence of the random vectors is handled through copulas. Moreover, Archimedean copulas are used to derive the random rows distribution. A convex approximation optimization problem is proposed for this class of stochastic geometric programming problems using a standard variable transformation. Furthermore, a piecewise tangent approximation and sequential convex approximation are employed to obtain the lower and upper bounds for the convex optimization model, respectively. Finally, an illustrative optimization example on randomly generated data is presented to demonstrate the efficiency of the methods and algorithms.
暂无评论