Viet Nam National University Ho Chi Minh City Logo

VNUHCM Journal of

Science and Technology Development

An official journal of Viet Nam National University Ho Chi Minh City, Viet Nam since 1997

ISSN: 1859-0128
Register Login
Article Open Access Logo

APPROXIMATE OPTIMALITY CONDITIONS AND DUALITY FOR CONVEX INFINITE PROGRAMMING PROBLEMS

Nguyen Dinh 1
Ta Quang Son 2

Volume & Issue: Vol. 10 No. 12 (2007) | Page No.: 29-38 | DOI: 10.32508/stdj.v10i12.2852
Published: 2007-12-15

Online metrics

Statistics from the website

  • Abstract Views: 1986
  • Galley Views: 813

Statistics from Dimensions

Statistics from PlumX
Copyright © 2007 by the author(s).

Copyright The Author(s) 2023. This article is published with open access by Vietnam National University, Ho Chi Minh city, Vietnam. This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0) which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited. 

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.

Comments