Skip to main content
Log in

On duality gap in linear conic problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Nesterov Y.E., Nemirovski A.S.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)

    Book  MATH  Google Scholar 

  2. Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  3. Rockafellar R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)

    Book  MATH  Google Scholar 

  4. 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

  5. Zălinescu C.: A note on d-stability of convex programs and limiting lagrangians. Math. Program. 53, 267–277 (1992)

    Article  MATH  Google Scholar 

  6. Zălinescu C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)

    Book  MATH  Google Scholar 

  7. Zălinescu C.: On zero duality gap and the Farkas lemma for conic programming. Math. Oper. Res. 33, 991–1001 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. Zălinescu.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0282-6

Keywords

Navigation