Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
Author(s):
Abstract:
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.
Keywords:
Language:
English
Published:
Control and Optimization in Applied Mathematics, Volume:2 Issue: 2, Summer-Autumn2017
Pages:
33 to 44
https://www.magiran.com/p1978112
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
Qualifications and stationarity for nonsmooth multiobjective problems with switching constraints
Sahar Niknam, *, Maryam Naderi Parizi, Zeynab Izadi
International Journal Of Nonlinear Analysis And Applications, Feb 2025 -
Optimality Conditions for Properly Efficient Solutions of Nonsmooth Multiobjective GSIP
Ali Asghar Hojatifard, *, Shahriar Farahmand Rad
Control and Optimization in Applied Mathematics, Winter-Spring 2024