On (p, r)-invexity-type nonlinear programming problems

20Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Mathematical programming problems involving (p, r)-invex functions with respect to η are considered. We introduce new classes of nonlinear programming problems, called KT-(p, r)-invex, WD-(p, r)-invex, and HC-(p, r)-invex problems (where p, r are some real numbers). It is shown that for these types of problems Kuhn-Tucker conditions are both necessary and sufficient for optimality. Furthermore, these (p, r)-invexity-type problems with r ≠ 0 are not sufficient for Wolfe weak duality. In this way it was shown that the optimization problems possessing "some kind" of invexity need not be equivalent to the class of optimization problems for which Kuhn-Tucker necessary conditions for optimality are also sufficient and Wolfe weak duality holds. © 2001 Elsevier Science.

Cite

CITATION STYLE

APA

Antczak, T. (2001). On (p, r)-invexity-type nonlinear programming problems. Journal of Mathematical Analysis and Applications, 264(2), 382–397. https://doi.org/10.1006/jmaa.2001.7665

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free