Unifying optimal partition approach to sensitivity analysis in conic optimization

E. Alper Yildirim (yildirimams.sunysb.edu)

Abstract: We study convex conic optimization problems in which the right-hand side and the cost vectors vary linearly as a function of a scalar parameter. We present a unifying geometric framework that subsumes the concept of the optimal partition in linear programming (LP) and semidefinite programming (SDP) and extends it to conic optimization. Similar to the optimal partition approach to sensitivity analysis in LP and SDP, the range of perturbations for which the optimal partition remains constant can be computed by solving two conic optimization problems. Under a weaker notion of nondegeneracy, this range is simply given by a minimum ratio test. We briefly discuss the properties of the optimal value function under such perturbations.

Keywords: sensitivity analysis, optimal partition, conic programming

Category 1: Linear, Cone and Semidefinite Programming

Citation: Journal of Optimization Theory and Applications, 122 (2) pp. 405-423 (2004)

Download:

Entry Submitted: 10/23/2001
Entry Accepted: 10/23/2001
Entry Last Modified: 12/12/2005

Modify/Update this entry