Approximate optimality conditions and duality for convex infinite programming problems

  • Nguyen Dinh
  • Ta Quang Son

Abstract

Necessary and sufficient conditions for -optimal solutions of convex infinite programming problems are established. These Kuhn-Tucker type conditions are derived based on a new version of Farkas' lemma proposed recently. Conditions for -duality and -saddle points are also given.
điểm /   đánh giá
Published
2008-03-05
Issue
Vol. 10 No. 12 (2007)
Section
ARTILES
Copyright belongs to VNU-HCM “Science and Technology Development” Journal. Any copy or reprinting of any form must be permitted by the Journal.