Sensitivity Analysis Of Quadratic Programs
Sensitivity Analysis of Quadratic Programs is a mathematical framework that characterizes the stability and variation of optimal solutions to quadratic programming problems in response to perturbations in problem parameters, distinguishing it from general sensitivity analyses by specifically addressing the structure imposed by quadratic objectives and linear constraints.
36
Publications
1.6K
Citations
61
Authors
45
Institutions
Publications per year
2017–2026
6
Parents
36
Sensitivity Analysis for Mean-Variance Portfolio Problems
Michael J. Best, Robert R. Grauer · Management Science · 1991 · 159 citations
1–5 of 36
61
3
h-index
3
h-index
2
h-index
1
h-index
1
h-index
1–5 of 61
45
George Washington University
Washington, United States
3 h-index
4 publications
225 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
4 publications
82 citations

Lomonosov Moscow State University
Moscow, Russia
2 h-index
2 publications
77 citations
Charles University
Prague, Czechia
2 h-index
2 publications
107 citations

Czech Technical University in Prague
Prague, Czechia
2 h-index
2 publications
126 citations
West Virginia University
Morgantown, United States
1 h-index
2 publications
64 citations

Vietnam National University Ho Chi Minh City
Ho Chi Minh City, Vietnam
1 h-index
1 publications
12 citations

Peoples' Friendship University of Russia
Moscow, Russia
1 h-index
1 publications
10 citations
1–8 of 45
6 publications · 306 citations
6
h-index
4 publications · 175 citations
4
h-index
2 publications · 71 citations
2
h-index
2 publications · 78 citations
2
h-index
1 publications · 102 citations
1
h-index
1–5