An easy way to obtain strong duality results in linear, linear semidefinite and linear semi-infinite programming

P.C. Pop, Georg J. Still

Research output: Book/ReportReportOther research output

73 Downloads (Pure)


In linear programming it is known that an appropriate non-homogeneous Farkas Lemma leads to a short proof of the strong duality results for a pair of primal and dual programs. By using a corresponding generalized Farkas lemma we give a similar proof of the strong duality results for semidefinite programs under constraint qualifications. The proof includes optimality conditions. The same approach leads to corresponding results for linear semi-infinite programs. For completeness, the proofs for linear programs and the proofs of all auxiliary lemmata for the semidefinite case are included.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente
Publication statusPublished - 1999

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-90C34
  • MSC-90C25
  • MSC-90C05
  • EWI-3313
  • IR-65682

Cite this