SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS

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.

MoreLess

Year of publication:	2008
Authors:	DHARA, ANULEKHA ; MEHRA, APARNA
Published in:	Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 25.2008, 02, p. 113-133
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Nonsmooth minimax program \| epigraph of conjugate functions \| ∊-subdifferentials \| epi-convergence \| sequential Lagrange multipliers \| sequential duality

Online Resource

Check full text access |

More access options

www.worldscinet.com

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005050706