Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 32, No. 1, February 2007, pp. 95-101
DOI: 10.1287/moor.1060.0217
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Yang, X. Q.
Right arrow Articles by Meng, Z. Q.
Right arrow Search for Related Content

Lagrange Multipliers and Calmness Conditions of Order p

X. Q. Yang, Z. Q. Meng

Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China
College of Business and Administration, Zhejiang University of Technology, Zhejiang, China

mayangxq{at}polyu.edu.hk, http://myweb.polyu.edu.hk/~mayangxq/index.htm
mengzhiqing{at}zjut.edu.cn

In this paper, by assuming that a non-Lipschitz penalty function is exact, new conditions for the existence of Lagrange multipliers are established for an inequality and equality-constrained continuously differentiable optimization problem. This is done by virtue of a first-order necessary optimality condition of the penalty problem, which is obtained by estimating Dini upper-directional derivatives of the penalty function in terms of Taylor expansions, and a Farkas lemma. Relations among the obtained results and some well-known constraint qualifications are discussed.

Key Words: non-Lipschitz penalty function; generalized calmness condition; Dini directional derivative; Lagrange multiplier
History: Received: August 18, 2005; revision received: December 30, 2005;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2007 by INFORMS.