Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
عنوان مقاله: Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
شناسه ملی مقاله: JR_COAM-2-2_003
منتشر شده در در سال 1396
شناسه ملی مقاله: JR_COAM-2-2_003
منتشر شده در در سال 1396
مشخصات نویسندگان مقاله:
Nader Kanzi - Department of Mathematics, Payame Noor University, P.O. Box. ۱۹۳۹۵-۳۶۹۷, Tehran, Iran
خلاصه مقاله:
Nader Kanzi - Department of Mathematics, Payame Noor University, P.O. Box. ۱۹۳۹۵-۳۶۹۷, Tehran, Iran
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality conditions as Fritz-John type for the problem.
کلمات کلیدی: Two-level programming, Constraint qualification, Optimality conditions, Lower level problem
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1605934/