-

 

 

 




Optimization Online





 

On duality gap in linear conic problems

C. Zalinescu(zalinesc***at***uaic.ro)

Abstract: In their paper ``Duality of linear conic problems" A. Shapiro and A. 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 A. 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 A. Shapiro and A. Nemirovski.

Keywords: Linear conic problems, duality gap

Category 1: Linear, Cone and Semidefinite Programming

Citation:

Download: [PDF]

Entry Submitted: 09/16/2010
Entry Accepted: 09/16/2010
Entry Last Modified: 09/16/2010

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society