.png){kind=icon}
.png){kind=icon}
Return
Study on two-stage uncertain programming based on uncertainty theory
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-014-1012-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, based on uncertainty theory, we first present a new class of two-stage uncertain programming model and give its deterministic equivalent programming problem. Then some fundamental properties of the two-stage uncertain programming problem, including the convexity of feasible set as well as objective function, are investigated. In addition, a solution method by employing an efficiently heuristic algorithm, called artificial bee colony algorithm, is applied to solve the two-stage uncertain programming problem. Finally, some numerical examples are provided to illustrate the novel method introduced in this paper.
Keywords:
Uncertainty theory
Two-stage uncertain programming
Convexity
Artificial bee colony algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.4
Papers:
3.5K
Citations:
1.1W
Organization
View more organizations