New optimality conditions and duality results of type in differentiable mathematical programming
Introduction
In the theory of constrained extremum problems, optimality conditions and duality results for differentiable nonlinear constrained problems are important theoretically as well as computationally and can be formulated in several different ways. In general, these criteria can be classified as either necessary or sufficient. The best-known necessary optimality criterion for a constrained mathematical programming problem is constituted by the Karush–Kuhn–Tucker optimality conditions (see, for example, [13]). However, the F. John criterion [13] is in a sense more general. In order for the Karush–Kuhn–Tucker optimality conditions to hold, one must impose some suitable constraint qualification [8], [13] on the constraints of the optimization problem. On the other hand, no such constraint qualification need be imposed on the constraints in order for the F. John optimality conditions to hold. In constrained optimization these necessary optimality conditions are also sufficient for optimality if the functions delimiting the mathematical programming problem are convex or satisfy certain generalized convexity properties such as pseudo-convexity or quasi-convexity (see, for example, [8], [13], [15].
However, in the recent years attempts have been made by several authors to define various classes of differentiable nonconvex functions and to study their duality and optimality criteria for solving such problems (see, for example, [1], [11], [12], [14], [18], [20], and others). One such generalization convex function is the invexity notion introduced by Hanson [11]. The term invex (which means invariant convex) was suggested by Craven [10]. Over the years, many generalizations of this concept have been given in the literature. For example, the concept of invexity of functions was also generalized to -invex functions by Suneja, Singh and Bector [19]. Using the definition of a weighted -mean (where is a real number) for a sequence of positive numbers, Antczak [1] introduced new classes of (nonconvex) differentiable functions and called them -invex with respect to , and also called their subclass -invex functions with respect to [3]. The class of -invex functions with respect to is an extension of the class of invex functions with respect to introduced by Hanson [11].
In this paper, we introduce a new class of nonconvex functions, called -invex functions. We extend an invexity notion [11] since the defined class of functions contains many various invexity concepts. A characteristic global optimality property of various classes of invex functions is also proved in the case of a -invex function. It turns out that every stationary point of a -invex function is its global minimum point. A sufficient condition for -invexity is also proved in the paper. Also, we state some relations between the introduced class of -invex functions with respect to and various classes of invex functions with respect to .
Furthermore, we introduce new F. John-type and Karush–Kuhn–Tucker-type problems, called -F. John and -Karush–Kuhn–Tucker problems, respectively; they are defined assuming differentiability of the functions involved. Then, we apply the -invexity notion introduced to develop optimality conditions of F. John type and Karush–Kuhn–Tucker type for constrained differentiable mathematical programming problems. We prove the sufficiency of the necessary optimality conditions of type defined for differentiable constrained optimization problems involving -invex functions with respect to the same function , but not necessarily with respect to the same function . In particular, we obtain optimality conditions of F. John type and Karush–Kuhn–Tucker type that are weaker than previous conditions presented in the literature.
Further considerations are devoted to duality in differentiable constrained mathematical programming problems. We define a new dual of Mond–Weir type, called the -Mond–Weir dual, for the constrained optimization problem considered. Then, various duality theorems are proved between the mathematical programming problem considered and the -Mond–Weir dual problem introduced. The main tool in proving these duality results is the concept of -invexity introduced. As in the case of establishing the sufficiency property for optimization problems of this type, we assume that all functions involved in the original optimization problems are-invex with respect to the same function , but not necessarily with respect to the same function . Also some examples are given to illustrate a nature of the class of nonconvex functions introduced.
Section snippets
-invex functions
In this section, we provide some definitions and some results that we shall use in the sequel. Definition 1 A function is said to be increasing if and only if
We shall also use a definition of an invex set with respect to . The definition of a set of this type was given by Ben-Israel and Mond [9] and subsequently studied by many authors including Mohan and Neogy [16], Pini [17], Antczak [1] and [2]. Definition 2 Let be a nonempty subset of , and let be an arbitrary point of .
Optimality conditions for nonlinear mathematical programming problems with -invex functions
Now, we consider the following nonlinear mathematical programming problem (P): where , , , are (continuously) differentiable functions, and is a nonempty open subset of . We denote the set of all feasible solutions in (P) by Now, we give our statement of the modified F. John problem called the -F. John problem:
-F. John problem:Find (if it exists) such that
Duality
In this section, we consider a modified Mond–Weir duality for the mathematical programming problem considered in Section 3.
We define the following dual problem of Mond–Weir type where and , , are defined as in the preceding section. We call it the -Mond–Weir-type dual problem.
Let be the set of all feasible
Conclusions
This work provides new optimality conditions and new duality results for differentiable mathematical problems. We have established new necessary optimality conditions of F. John and Karush–Kuhn–Tucker type, called -F. John and -Karush–Kuhn–Tucker conditions, respectively, for differentiable constrained optimization problems. It is pointed out that our statements of the F. John and Karush–Kuhn–Tucker necessary optimality conditions of type are more general than the classical ones found for
References (20)
Relationships between pre-invex concepts
Nonlinear Analysis
(2005)-pre-invexity and -invexity in mathematical programming
Computers and Mathematics with Applications
(2005)On sufficiency of the Kuhn–Tucker conditions
Journal of Mathematical Analysis and Applications
(1981)- et al.
On invex sets and preinvex functions
Journal of Mathematical Analysis and Applications
(1995) - et al.
Optimality criteria in mathematical programming involving generalized invexity
Journal of Mathematical Analysis and Applications
(1988) -invex sets and functions
Journal of Mathematical Analysis and Applications
(2001)An -approximation method in mathematical programming problems
Numerical Functional Analysis and Optimization
(2004)- T. Antczak, G-pre-invexity in mathematical programming, 2005 (in...
- et al.
Generalized Concavity
(1987) -convex functions
Mathematical Programming
(1972)