1 October 2013 in International Journal of Production Economics
1 April 2013 in Computers & Operations Research
RSRoohollah Aliakbari Shandiz
Roohollah Aliakbari Shandiz
AJAbdolhamid Eshraghniaye Jahromi
Abdolhamid Eshraghniaye Jahromi
3 November 2019 in Optimization
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behaviour of the optimal partition and optimal set mapping on a so-called nonlinearity interval. Furthermore, we investigate the sensitivity of the approximation of the optimal partition in a nonlinearity interval, which has been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the optimal partition was obtained from a bounded sequence of interior solutions on, or in a neighbourhood of the central path. We derive an upper bound on the distance between the approximations of the optimal partitions of the original and perturbed problems. Finally, we examine the theoretical bounds by way of experimentation.
1 November 2022 in Mathematics of Operations Research
This paper revisits the parametric analysis of semidefinite optimization problems with respect to the perturbation of the objective function along a fixed direction. We review the notions of invariancy set, nonlinearity interval, and transition point of the optimal partition, and we investigate their characterizations. We show that the set of transition points is finite and the continuity of the optimal set mapping, on the basis of Painlevé–Kuratowski set convergence, might fail on a nonlinearity interval. Under a local nonsingularity condition, we then develop a methodology, stemming from numerical algebraic geometry, to efficiently compute nonlinearity intervals and transition points of the optimal partition. Finally, we support the theoretical results by applying our procedure to some numerical examples.
1 August 2014 in Journal of the Operational Research Society
18 August 2021 in Mathematical Programming