1. Introduction
Duality mathematical programming is used in Economics, Control Theory, Business and other diverse fields. In mathematical programming, a pair of primal and dual problems are said to be symmetric when the dual of the dual is the primal problem, i.e., when the dual problem is expressed in the form of the primal problem, then it does happen that its dual is the primal problem. This type of dual problem was introduced by Dorn [
1], later on Mond and Weir [
2] studying them under weaker convexity assumptions.
Antczak [
3] introduced the notion of
G-invex function obtaining some optimality conditions which he himself [
4] comprehends to be a
-invex function, deriving optimality conditions for a multiobjective nonlinear programming problem. Ferrara and Stefaneseu [
5] also discussed the conditions of optimality and duality for multiobjective programming problem, and Chen [
6] considered multiobjective fractional problems and its duality theorems under higher-order
- convexity.
In recent years, several definitions such as nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudoinvex functions have been introduced by Xianjun [
7]. By introducing these new concepts, sufficient optimality conditions for a nonsmooth multiobjective problem were obtained and, a fortiori, weak and strong duality results were established for a Mond-Weir type multiobjective dual program.
Jiao [
8] introduced new concepts of nonsmooth
-invex and generalized type I univex functions over cones by using Clarke’s generalized directional derivative and
-invexity for a nonsmooth vector optimization problem with cone constraints. Op. cit. also established sufficient optimality conditions and Mond-Weir type duality results under
-invexity and type I cone-univexity assumptions. Very recently Dubey et al. [
9] studied further Mond-Weir type dual model multiobjective programming problems over arbitrary cones.
Pitea and Postolache [
10] developed the study of a new class of multi-time multiobjective variational problems of minimizing a vector of functionals of curvilinear integral type by means of which they were able to obtain results concerning duals of Mond-Weir type, generalized Mond-Weir-Zalmai type and under some assumptions of
-quasi-invexity, proving that the value of the objective function of the primal cannot exceed the value of the dual. And Pitea and Antczak [
11] provided additional duality Mond-Weir type results and in the sense of Wolfe for multi-time multiobjective variational problems with univex functionals.
In the present paper we consider a pair of K-G-Mond-Weir type multiobjective symmetric dual program for which we establish the weak duality theorem, as well as the corresponding strong, and converse ones under K--pseudo-invexity/strongly K--pseudo-invexity assumptions. In the process we construct a lemma that enables us to prove the strength and converse duality theorems under K--pseudo-invexity/strongly K--pseudo-invexity assumptions.
2. Preliminaries and Definitions
As usual, throughout this paper, will stand for the n-dimensional Euclidean space and for its non-negative orthant. Let be a vector-valued differentiable function defined on a nonempty open set and be the range of , that is, the image of X under such that any its component is strictly increasing on the range of .
Definition 1. Let S be a cone in , the positive polar cone of S is defined by Given two closed convex pointed cones K and Q with nonempty interiors in and , respectively, we consider two vector minimization problems, each of them accompanied by a natural weak minimum definition.
(KMP) K-minimize
Subject to
where and are differentiable functions defined on
Definition 2. A point is said to be a weak minimum of (KMP) if there exists no other such that .
Lemma 1. If is a weak minimum of (KMP), then there exist , which are not simultaneously zero such that The second vector minimization problem that we consider is the following one.
(KGMP) K-minimize
Subject to
Remark 1. If and then the vector minimization problem (KGMP) reduces to vector minimization problem (KMP).
Definition 3. A point is said to be a weak minimum of (KGMP) if there exists no other such that .
Lemma 2. If is a weak minimum of (KGMP), then there exist , which are not simultaneously zero such that Let and be two closed convex cones with non-empty interiors, and let and be two non-empty open sets in and , respectively, so that . Given a vector valued differentiable function we consider the following definitions.
Definition 4. The function f is said to be K-η-pseudoinvex at , if and for fixed , we have Definition 5. The function f is said to be strongly -pseudoinvex at , if and for fixed , we have Definition 6. The function f is said to be K--pseudoinvex at (with respect to η) if and for fixed , we have Remark 2. If then Definition becomes -pseudoinvex (Definition 4).
Definition 7. The function f is said to be strongly -pseudoinvex at (with respect to η) if and for fixed , we have Remark 3. If then Definition 7 reduces in -pseudoinvex (see, Definition 5).
Finally we recall that [
12] given a compact convex set
C in
, the support function of
C is defined by
The subdifferential of
is given by
For any convex set
, the normal cone to
S at a point
is defined by
It is readily verified that for a compact convex set
S,
if and only if
3. K-G-Mond-Weir Type Primal Dual Model
In this section, we consider a multiobjective K-G-Mond–Weir type primal-dual model over arbitrary cones:
(KGMPP) K-minimize
(KGMDP) K-maximize
Subject to
where, for
it holds that:
- (I)
and are the positive polar cones of and , respectively.
- (II)
Given has any of its components as a strictly increasing function on its domain, is a differentiable function.
Next we prove weak, strong and converse duality theorems for (KGMPP) and (KGMDP), respectively.
Let and be the set of feasible solutions of (KGMPP) and (KGMDP), respectively.
Theorem 1 (Weak duality theorem).
Let and . Let
- (i)
be strongly K--pseudoinvex at u with respect to
- (ii)
be K--pseudoincave at y with respect to
- (iii)
- (iv)
Proof. The proof is given by contradiction. Suppose that (
7) does not hold. Then,
For the dual constraint (
4) and assumption
we get
Using the dual constraint (
5) in the above inequality, we deduce that
or equivalently,
Taking into account that
,
By hypothesis
it holds that
Having in mind (
8), we obtain
On the similar lines to the above proof, we have
By using now generalized convexity assumptions, it follows that
a contradiction with (
9). Hence, the conclusion follows. □
Theorem 2 (Strong duality theorem).
Letbe a weak efficient solution of (KGMPP); fixin (KGMDP) and suppose that
- (i)
is linearly independent,
- (ii)
Then, and the objective values of (KGMPP) and (KGMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for all feasible solutions of (KGMPP) and (KGMDP), then is a weak efficient solution of (KGMDP).
Proof. Since
is a weak efficient solution of (KGMPP), by Lemma 2, then there exist
,
,
and
such that
Since
and
, Equation (
13) implies
.
Taking
in (
10), we deduce that
This implies that being the normal cone to at .
Since
we obtain that
By assumption
, we have
Now, we claim that
Indeed, if
then (
10) becomes
By hypothesis
, we have
Since
and since
, we get
. Thus, from (
16), we have
. A contradiction with the fact that
Hence, i.e.,
Now, the last equation and (
16) yield
By independence linearity hypothesis
, this implies that
From
, and
for some
it follows that
Now from (
16), (
19) and
we have
a contradiction with (
14). Hence
Therefore,
.
Taking
in (
10), (
16) and assumption
provide that
Since
, from (
19) and (
20), we get
Picking some
, then
since
is a closed convex cone. By making
to play the role of
x in (
20), we get
By considering simultaneously
and
in (
20), we have
Since
and
, we get
From (
22) and (
23), it follows that
. Moreover, if the hypothesis in Theorem 1 hold, then we conclude that
is a weak minimum of (KGMDP), and the two objective values coincide, QED. □
Thanks to the fact that under symmetric duality, the converse duality theorem proof works in the same as for the strong duality theorem, Theorem 1 infers the following result.
Theorem 3 (Converse duality theorem).
Let be a weak efficient solution of (KGMDP); fix in (KGMPP) and suppose that
- (i)
is linearly independent,
- (ii)
Then and the objective values of (KGMPP) and (KGMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for every feasible solution of (KGMPP) and (KGMDP), then is a weak efficient solution of (KGMPP).
4. K-N-G-Mond–Weir Type Nondifferentiable Dual Model
Herein, we consider a nondifferentiable multiobjective K-N-G-Mond–Weir primal-dual model over arbitrary cones.
(KGNMPP) K-minimize
(KGNMDP) K-maximize
Subject to
where for
it holds that:
- (I)
and are the positive polar cones of and , respectively.
- (II)
Given has any of its components as a strictly increasing function on its domain, is a differentiable function.
- (III)
and are compact convex sets in and , respectively.
- (IV)
and are the support functions of and , respectively.
Remark 4. In the primal- dual model (K-N-G- Mond-Weir type nondifferentiable dual model), we used support function for a nondifferentiable term.
Now we are ready to provide three duality theorems for (KGNMPP) and (KGNMDP). Their proofs are easily obtained by mimicking the ones of the three theorems obtained in the previous section.
Let and be the set of feasible solutions of (KGNMPP) and (KGNMDP), respectively.
Theorem 4 (Weak duality theorem).
Let and . Let
- (i)
and be strongly K--pseudoinvex and strongly pseudoinvex, respectively, at u with respect to
- (ii)
and be K--pseudoincave and -pseudoinvex, respectively, at y with respect to
- (iii)
- (iv)
Proof. The proof is given by contradiction. Suppose that (
31) does not hold. Then,
For the dual constraint (
28) and assumption
we get
Using the dual constraint (
29) in the above inequality, we deduce that
or equivalently,
Remaining part of proof follows almost similar to the Theorem 1. □
Theorem 5 (Strong duality theorem).
Let be a weak efficient solution of (KGNMPP); fix in (KGNMDP) and suppose that:
- (i)
is linearly independent,
- (ii)
Then there exists such that and the objective values of (KGNMPP) and (KGNMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for all feasible solutions of (KGNMPP) and (KGNMDP), then is a weak efficient solution of (KGNMDP).
Finally, the following result becomes the sibling result of the last one obtained in the previous section.
Theorem 6 (Converse duality theorem).
Let be a weak efficient solution of (KGNMDP); fix in (KGNMPP) and suppose that:
- (i)
is linearly independent,
- (ii)
Then, there exists such that and the objective values of (KGNMPP) and (KGNMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for all feasible solutions of (KGNMPP) and (KGNMDP), then is a weak efficient solution of (KGNMPP).
5. Conclusions
By using the notion of K-- pseudo-invex/ strongly - pseudo-invex functions we have established duality results for (KGMPP) /(KGNMPP)-Mond–Weir dual models applied in multiobjective nondifferentiable symmetric programming problems with objective cone and cone constraints, too. This work may be inspirational for extension to nondifferentiable higher-order symmetric fractional programming.