Farkas-type results and duality for DC programs with convex constraintsReport as inadecuate

Farkas-type results and duality for DC programs with convex constraints - Download this document for free, or read online. Document in PDF available to download.

1 Department of Mathematics, International University 2 LMAP - Laboratoire de Mathématiques et de leurs Applications Pau 3 Department of Mathematics and Computer Science

Abstract : In this paper, we are interested in new versions of Farkas lemmas for systems involving convex and DC-inequalities. These versions extend well-known Farkas-type results published recently, which were used as main tools in the study of convex optimization problems. The results are used to derive several strong duality results such as: Lagrange, Fenchel-Lagrange or Toland-Fenchel-Lagrange duality for DC and convex problems. Moreover, it is shown that for this class of problems, these versions of Farkas lemma are actually equivalent to several strong duality results of Lagrange, Fenchel-Lagrange or Toland- Fenchel-Lagrange types.

Keywords : Generalized Farkas lemmas DC-programs Toland Fenchel Lagrange duality approximate normal cones

Author: N. Dinh - Guy Vallet - T.T.A. Nghia -

Source: https://hal.archives-ouvertes.fr/


Related documents