On duality gap in linear conic problems

نویسنده

  • Constantin Zalinescu
چکیده

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

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality of linear conic problems

It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least one of these problems is feasible. It is also well known that for linear conic problems this property of “no duality gap” may not hold. It is then natural to ask whether there exist some other convex closed cones, apart from polyhedral, for which the “no duality gap” propert...

متن کامل

On duality theory of conic linear problems

In this paper we discuss duality theory of optimization problems with a linear objective function and subject to linear constraints with cone inclusions, referred to as conic linear problems. We formulate the Lagrangian dual of a conic linear problem and survey some results based on the conjugate duality approach where the questions of “no duality gap” and existence of optimal solutions are rel...

متن کامل

Universal duality in conic convex optimization

Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +∞ and −∞. In contrast, for optimization problems over nonpolyhedral convex cones, a nonzero duality gap can exist when either the primal or the dual is fe...

متن کامل

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

On Zero Duality Gap and the Farkas Lemma for Conic Programming

Recently S.A. Clark published an interesting duality result in linear conic programming dealing with a convex cone that is not closed in which the usual (algebraic) dual problem is replaced by a topological dual with the aim to have zero duality gap under certain usual hypotheses met in mathematical finance. We present some examples to show that an extra condition is needed for having the concl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Optimization Letters

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2012