Open Access  

Downloads

Download data is not yet available.

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.

Author's Affiliation
Article Details

Issue: Vol 10 No 12 (2007)
Page No.: 29-38
Published: Dec 15, 2007
Section: Article
DOI: https://doi.org/10.32508/stdj.v10i12.2852

 Copyright Info

Creative Commons License

Copyright: The Authors. This is an open access article distributed under the terms of the Creative Commons Attribution License CC-BY 4.0., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

 How to Cite
Dinh, N., & Son, T. (2007). APPROXIMATE OPTIMALITY CONDITIONS AND DUALITY FOR CONVEX INFINITE PROGRAMMING PROBLEMS. Science and Technology Development Journal, 10(12), 29-38. https://doi.org/https://doi.org/10.32508/stdj.v10i12.2852


 Download Citation
 Cited by

Article level Metrics by Paperbuzz/Impactstory
Article level Metrics by Altmetrics

 Article Statistics
HTML = 911 times
Download PDF   = 376 times
Total   = 376 times