ダウンロード数 : ?
言語
英語
著者
内容記述(抄録等)
In mathematical programming, various kinds of optimality conditions have been introduced. In the research of optimality conditions, some types of subdifferentials play an important role. Recently, by using Greenberg–Pierskalla subdifferential and Martínez-Legaz subdifferential, necessary and sufficient optimality conditions for quasiconvex programming have been introduced. On the other hand, constraint qualifications are essential elements for duality theory in mathematical programming. Over the last decade, necessary and sufficient constraint qualifications for duality theorems have been investigated extensively. Recently, by using the notion of generator, necessary and sufficient constraint qualifications for Lagrange-type duality theorems have been investigated. However, constraint qualifications for optimality conditions in terms of Greenberg–Pierskalla subdifferential and Martínez-Legaz subdifferential have not been investigated yet. In this paper, we study optimality conditions and constraint qualifications for quasiconvex programming. We introduce necessary and sufficient optimality conditions in terms of Greenberg–Pierskalla subdifferential, Martínez-Legaz subdifferential and generators. We investigate necessary and/or sufficient constraint qualifications for these optimality conditions. Additionally, we show some equivalence relations between duality results for convex and quasiconvex programming.
主題
Quasiconvex programming
Optimality condition
Constraint qualification
Generator of a quasiconvex function
掲載誌名
Journal of Optimization Theory and Applications
183
3
開始ページ
963
終了ページ
976
ISSN
0022-3239
ISSN(Online)
1573-2878
発行日
2019-12
DOI
出版者
Springer
資料タイプ
学術雑誌論文
ファイル形式
PDF
著者版/出版社版
著者版
業績ID
e36991
部局
総合理工学部
備考
;学外公開
このエントリーをはてなブックマークに追加