z-logo
open-access-imgOpen Access
ALMOST e - QUASISOLUTIONS OF A NONCONVEX PROGRAMMING PROBLEM WITH AN INFINITE NUMBER OF CONSTRAINTS
Author(s) -
Thach Van Tran,
Son Quang Ta
Publication year - 2012
Publication title -
khoa học công nghệ
Language(s) - English
Resource type - Journals
ISSN - 1859-0128
DOI - 10.32508/stdj.v15i3.1847
Subject(s) - mathematics , duality (order theory) , karush–kuhn–tucker conditions , mathematical optimization , combinatorics
Under a generalized Karush – Kuhn – Tucker condition up to e, we establish some sufficient optimality conditions for almost e- quasisolutions of a nonconvex programming problem which has an infinite number of constraints. Some results on -weak duality in Mond-Weir type for the problem are also introduced

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here