Polyhedral Uncertainty Sets
Polyhedral Uncertainty Sets is a type of uncertainty set in optimization under uncertainty that belongs to the class of geometrically defined feasible regions, distinguished by its representation as a convex polyhedron described by a finite system of linear inequalities, thereby modeling uncertain parameters within bounded, piecewise-linear constraints.
86
Publications
4K
Citations
193
Authors
113
Institutions
Publications per year
2017–2026
46
86
Zukui Li, Ran Ding, Christodoulos A. Floudas · Industrial & Engineering Chemistry Research · 2011 · 257 citations
Robust Linear Optimization With Recourse
Tara Terry, Marina A. Epelman · 2009 · 129 citations
1–5 of 86
193
7
h-index
6
h-index
4
h-index
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 439 citations
3
h-index
1–5 of 193
113

Semnan University
Semnan, Iran
7 h-index
9 publications
635 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
803 citations
Qazvin Islamic Azad University
Qazvin, Iran
5 h-index
4 publications
230 citations

Lehigh University
Bethlehem, United States
3 h-index
3 publications
102 citations
Princeton University
Princeton, United States
3 h-index
7 publications
1.1K citations

University of South Australia
Adelaide, Australia
3 h-index
3 publications
151 citations
Google (United States)
Mountain View, United States
3 h-index
4 publications
253 citations

Flinders University
Adelaide, Australia
3 h-index
6 publications
302 citations
1–8 of 113
5 publications · 300 citations
5
h-index
5 publications · 612 citations
5
h-index
4 publications · 405 citations
4
h-index
3 publications · 61 citations
3
h-index
3 publications · 138 citations
3
h-index
1–5