On Nonsmooth Semi-Infinite Minimax Programming Problem with ( Φ , ρ ) -Invexity
Joint Authors
Yuan, D. H.
Liu, X. L.
Lai, G. M.
Xu, C. Q.
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-03-04
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
We are interested in a nonsmooth minimax programming Problem (SIP).
Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem.
Under the Lipschitz ( Φ , ρ ) -invexity assumptions, we derive the sufficiency of the necessary optimality conditions for the same problem.
We also formulate dual and establish weak, strong, and strict converse duality theorems for Problem (SIP) and its dual.
These results extend several known results to a wider class of problems.
American Psychological Association (APA)
Liu, X. L.& Lai, G. M.& Xu, C. Q.& Yuan, D. H.. 2014. On Nonsmooth Semi-Infinite Minimax Programming Problem with ( Φ , ρ ) -Invexity. Abstract and Applied Analysis،Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1033683
Modern Language Association (MLA)
Liu, X. L.…[et al.]. On Nonsmooth Semi-Infinite Minimax Programming Problem with ( Φ , ρ ) -Invexity. Abstract and Applied Analysis No. 2014 (2014), pp.1-7.
https://search.emarefa.net/detail/BIM-1033683
American Medical Association (AMA)
Liu, X. L.& Lai, G. M.& Xu, C. Q.& Yuan, D. H.. On Nonsmooth Semi-Infinite Minimax Programming Problem with ( Φ , ρ ) -Invexity. Abstract and Applied Analysis. 2014. Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1033683
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1033683
