Unboundedness Analysis

Unboundedness Analysis is a methodological framework within linear programming that identifies and examines conditions under which the feasible region of a linear optimization problem extends infinitely in a direction that improves the objective function without bound.

48

Publications

2K

Citations

95

Authors

62

Institutions

Publications per year

2017–2026

4

Authors

95

  1. WT
    Wiesława T. Obuchowska

    University of Windsor, Canada

    2 publications · 26 citations

    2

    h-index

  2. DD
    Dorothee D. Haroske

    Friedrich Schiller University Jena, Germany

    2 publications · 30 citations

    2

    h-index

  3. HJ
    Hrvoje Jasak

    University of Zagreb, Croatia

    2 publications · 570 citations

    2

    h-index

  4. LS
    Leszek Skrzypczak

    Adam Mickiewicz University in Poznań, Poland

    2 publications · 30 citations

    2

    h-index

  5. SD
    Susana D. Moura

    University of Coimbra, Portugal

    2 publications · 30 citations

    2

    h-index

1–5 of 95

Venues

  1. Operations Research

    5 publications · 202 citations

    5

    h-index

  2. 3

    h-index

  3. Nonlinear Analysis

    2 publications · 28 citations

    2

    h-index

  4. European Journal of Operational Research

    2 publications · 26 citations

    2

    h-index

  5. 2

    h-index

1–5