number of downloads : ?
File
Thumnail PJO12_87.pdf 102 KB ( 限定公開 )
language
eng
Author
Suzuki, Satoshi Department of Mathematics, Interdisciplinary Graduate School of Science and Engineering, Shimane University
Kuroiwa, Daishi Department of Mathematics, Interdisciplinary Graduate School of Science and Engineering, Shimane University
Description
In this paper, we study a constraint qualification which completely characterizes surrogate duality for quasiconvex programming. We show that the closed cone constraint qualification for surrogate duality is a necessary and sufficient constraint qualification for surrogate strong duality and surrogate min-max duality via quasiconvex programming with convex constraints. Also, we compare our constraint qualification with previous ones for Lagrange duality and surrogate duality.
Subject
surrogate strong duality
surrogate min-max duality
quasiconvex programming
constraint qualification
Journal Title
Pacific Journal of Optimization
Volume
12
Issue
1
Start Page
87
End Page
100
ISSN
13489151
Published Date
2016-01
Publisher
Yokohama Publishers
NII Type
Journal Article
Format
PDF
Resource URL(IsVersionOf)
http://www.ybook.co.jp/online2/pjov12-1.html
Rights
Copyright © 2016 Yokohama Publishers
Text Version
著者版
Gyoseki ID
e28329
OAI-PMH Set
Interdisciplinary Graduate School of Science and Engineering
Remark
本誌はYokohama Publishersの電子ジャーナルサイトから冊子体発行後、一定期間を設けて無料で公開されます。
このエントリーをはてなブックマークに追加