REFINEMENTS OF $\VAREPSILON$-DUALITY THEOREMS FOR A NONCONVEX PROBLEM WITH AN INFINITE NUMBER OF CONSTRAINTS

Authors

  • T. Son Faculty of Mathematics & Applications, Saigon University, 273 An Duong Vuong Street, District 5, HCMC,Vietnam

Abstract

Some remarks on approximate optimality conditions of a nonconvex optimization problem which has an infinite number of constraints are given. Results on $\epsilon$-duality theorems of the problem are refined by using a mixed type dual problem of Wolfe and Mond-Weir type.

Downloads

Published

2013-07-07

How to Cite

Son, T. (2013). REFINEMENTS OF $\VAREPSILON$-DUALITY THEOREMS FOR A NONCONVEX PROBLEM WITH AN INFINITE NUMBER OF CONSTRAINTS. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 4(2), 61-70. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/252

Issue

Section

Research Article