Relatively Complete Recourse

Relatively Complete Recourse is a structural property in stochastic programming ensuring that for every feasible first-stage decision and almost every realization of the uncertain parameters, there exists a feasible second-stage recourse decision, thereby distinguishing it from more restrictive recourse conditions by allowing solution feasibility to be maintained across the support of the uncertainty distribution.

22

Publications

1.3K

Citations

33

Authors

32

Institutions

Publications per year

2017–2026

7

Authors

33

  1. RJ
    Roger J.‐B. Wets

    University of California, Davis, United States

    5 publications · 284 citations

    5

    h-index

  2. RT
    R. T. Rockafellar

    University of Washington, United States

    3 publications · 229 citations

    3

    h-index

  3. SS
    Suvrajeet Sen

    University of Arizona, United States

    2 publications · 85 citations

    2

    h-index

  4. DB
    Dimitris Bertsimas

    Massachusetts Institute of Technology, United States

    2 publications · 54 citations

    2

    h-index

  5. SW
    Stein W. Wallace

    Norwegian School of Economics, Norway

    2 publications · 55 citations

    2

    h-index

1–5 of 33

Venues

  1. Mathematical Programming

    4 publications · 452 citations

    4

    h-index

  2. SIAM Journal on Control and Optimization

    3 publications · 215 citations

    3

    h-index

  3. Operations Research

    3 publications · 236 citations

    3

    h-index

  4. INFORMS Journal on Computing

    2 publications · 55 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 14 citations

    1

    h-index

1–5