REFINEMENTS OF $\VAREPSILON$-DUALITY THEOREMS FOR A NONCONVEX PROBLEM WITH AN INFINITE NUMBER OF CONSTRAINTS
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.
How to Cite
Copyright (c) 2010 Journal of Nonlinear Analysis and Optimization: Theory & Applications
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.