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

Authors

193

  1. NA
    Nima Amjady

    Semnan University, Iran

    5 publications · 398 citations

    7

    h-index

  2. SD
    Shahab Dehghan

    Semnan University, Iran

    5 publications · 400 citations

    6

    h-index

  3. MA
    Mehrdad Aghamohamadi

    Flinders University, Australia

    4 publications · 174 citations

    4

    h-index

  4. AA
    Ahmad Attarha

    Australian National University, Australia

    3 publications · 214 citations

    3

    h-index

  5. DB
    Dimitris Bertsimas

    Massachusetts Institute of Technology, United States

    3 publications · 439 citations

    3

    h-index

1–5 of 193

Venues

  1. IEEE Transactions on Smart Grid

    5 publications · 300 citations

    5

    h-index

  2. Operations Research

    5 publications · 612 citations

    5

    h-index

  3. Industrial & Engineering Chemistry Research

    4 publications · 405 citations

    4

    h-index

  4. 3

    h-index

  5. Computers & Industrial Engineering

    3 publications · 138 citations

    3

    h-index

1–5