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
Parents
48
95
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 95
62

Adam Mickiewicz University in Poznań
Poznan, Poland
2 h-index
2 publications
30 citations
Friedrich Schiller University Jena
Jena, Germany
2 h-index
2 publications
30 citations

Imperial College London
London, United Kingdom
2 h-index
4 publications
1.1K citations

University of Windsor
Windsor, Canada
2 h-index
4 publications
52 citations

University of Coimbra
Coimbra, Portugal
2 h-index
2 publications
30 citations
Hunan Normal University
Changsha, China
1 h-index
2 publications
186 citations

University of Johannesburg
Johannesburg, South Africa
1 h-index
1 publications
10 citations
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
1 h-index
1 publications
12 citations
1–8 of 62
5 publications · 202 citations
5
h-index
3 publications · 608 citations
3
h-index
2 publications · 28 citations
2
h-index
2 publications · 26 citations
2
h-index
2 publications · 125 citations
2
h-index
1–5