SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS

Anulekha Dhara () and Aparna Mehra ()
Additional contact information
Anulekha Dhara: Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi-110016, India
Aparna Mehra: Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi-110016, India

Asia-Pacific Journal of Operational Research (APJOR), 2008, vol. 25, issue 02, 113-133

Abstract: In this article, we study nonsmooth convex minimax programming problems with cone constraint and abstract constraint. Our aim is to develop sequential Lagrange multiplier rules for this class of problems in the absence of any constraint qualification. These rules are obtained in terms of ∊-subdifferentials of the functions. As an application of these rules, a sequential dual is proposed and sequential duality results are presented.

Keywords: Nonsmooth minimax program; epigraph of conjugate functions; ∊-subdifferentials; epi-convergence; sequential Lagrange multipliers; sequential duality (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595908001729
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:25:y:2008:i:02:n:s0217595908001729

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595908001729

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().