Abstract
In their paper “Duality of linear conic problems” Shapiro and Nemirovski considered two possible properties (A) and (B) for dual linear conic problems (P) and (D). The property (A) is “If either (P) or (D) is feasible, then there is no duality gap between (P) and (D)”, while property (B) is “If both (P) and (D) are feasible, then there is no duality gap between (P) and (D) and the optimal values val(P) and val(D) are finite”. They showed that (A) holds if and only if the cone K is polyhedral, and gave some partial results related to (B). Later Shapiro conjectured that (B) holds if and only if all the nontrivial faces of the cone K are polyhedral. In this note we mainly prove that both the “if” and “only if” parts of this conjecture are not true by providing examples of closed convex cone in \({\mathbb{R}^{4}}\) for which the corresponding implications are not valid. Moreover, we give alternative proofs for the results related to (B) established by Shapiro and Nemirovski.
Similar content being viewed by others
References
Nesterov Y.E., Nemirovski A.S.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)
Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Rockafellar R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)
Shapiro, A., Nemirovski, A.S.: Duality of linear conic problems, Preprint, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta (2003). http://www.optimization-online.org/DB_HTML/2003/12/793.html
Zălinescu C.: A note on d-stability of convex programs and limiting lagrangians. Math. Program. 53, 267–277 (1992)
Zălinescu C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)
Zălinescu C.: On zero duality gap and the Farkas lemma for conic programming. Math. Oper. Res. 33, 991–1001 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zălinescu, C. On duality gap in linear conic problems. Optim Lett 6, 393–402 (2012). https://doi.org/10.1007/s11590-011-0282-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-011-0282-6