- Research
- Open access
- Published:
Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems
Journal of Inequalities and Applications volume 2014, Article number: 333 (2014)
Abstract
In this paper, a new class of generalized of nonconvex multitime multiobjective variational problems is considered. We prove the sufficient optimality conditions for efficiency and proper efficiency in the considered multitime multiobjective variational problems with univex functionals. Further, for such vector variational problems, various duality results in the sense of Mond-Weir and in the sense of Wolfe are established under univexity. The results established in the paper extend and generalize results existing in the literature for such vector variational problems.
MSC:65K10, 90C29, 90C30.
1 Introduction
Multiobjective variational problems are very prominent amongst constrained optimization models because of their occurrences in a variety of popular contexts, notably, economic planning, advertising investment, production and inventory, epidemic, control of a rocket, etc.; for an excellent survey, see [1] Chinchuluun and Pardalos.
Several classes of functions have been defined for the purpose of weakening the limitations of convexity in mathematical programming, and also for multiobjective variational problems. Several authors have contributed in this direction: [2] Aghezzaf and Khazafi, [3] Ahmad and Sharma, [4] Arana-Jiménez et al., [5] Bector and Husain, [6] Bhatia and Mehra, [7] Hachimi and Aghezzaf, [8] Mishra and Mukherjee, [9–11] Nahak and Nanda, and others.
One class of such multiobjective optimization problems is the class of vector PDI&PDE-constrained optimization problems in which partial differential inequalities or/and equations represent a multitude of natural phenomena of some applications in science and engineering. The areas of research which strongly motivate the PDI&PDE-constrained optimization include: shape optimization in fluid mechanics and medicine, optimal control of processes, structural optimization, material inversion - in geophysics, data assimilation in regional weather prediction modeling, etc. PDI&PDE-constrained optimization problems are generally infinite dimensional in nature, large and complex, [12] Chinchuluun et al.
The basic optimization problems of path-independent curvilinear integrals with PDE constraints or with isoperimetric constraints, expressed by the multiple integrals or path-independent curvilinear integrals, were stated for the first time by Udrişte and Ţevy in [13]. Later, optimality and duality results for PDI&PDE-constrained optimization problems were established by Pitea et al. in [14] and [15].
Recently, nonconvex optimization problems with the so-called class of univex functions have been the object of increasing interest, both theoretical and applicative, and there exists nowadays a wide literature. This class of generalized convex functions was introduced in nonlinear scalar optimization problems by Bector et al. [16] as a generalization of the definition of an invex function introduced by Hanson [17]. Later, Antczak [18] used the introduced η-approximation approach for nonlinear multiobjective programming problems with univex functions to obtain new sufficient optimality conditions for such a class of nonconvex vector optimization problems. In [19], Popa and Popa defined the concept of ρ-univexity as a generalization univexity and ρ-invexity. Mishra et al. [20] established some sufficiency results for multiobjective programming problems using Lagrange multiplier conditions, and under various types of generalized V-univexity type-I requirements, they proved weak, strong and converse duality theorems. In [21], Khazafi and Rueda established sufficient optimality conditions and mixed type duality results under generalized V-univexity type I conditions for multiobjective variational programming problems.
In this paper, we study a new class of nonconvex multitime multiobjective variational problems of minimizing a vector-valued functional of curvilinear integral type. In order to prove the main results in the paper, we introduce the definition of univexity for a vectorial functional of curvilinear integral type. Thus, we establish the sufficient optimality conditions for a proper efficiency in the multitime multiobjective variational problem under univexity assumptions imposed on the functionals constituting such vector variational problems. Further, we define the multiobjective variational dual problems in the sense of Mond-Weir and in the sense of Wolfe, and we prove several dual theorems under suitable univex assumptions. The results are established for a multitime multiobjective variational problem, in which involved functions are univex with respect to the same function Φ, but not necessarily with respect to the same function b.
2 Preliminaries and definitions
The following convention for equalities and inequalities will be used in the paper.
For any , , we define:
-
(i)
if and only if for all ;
-
(ii)
if and only if for all ;
-
(iii)
if and only if for all ;
-
(iv)
if and only if and .
Let and be Riemannian manifolds of dimensions p and n, respectively. The local coordinates on T and M will be written , and , , respectively.
Further, let be the first order jet bundle associated to T and M.
Using the product order relation on , the hyperparallelepiped in , with diagonal opposite points and , can be written as being the interval . Assume that is a piecewise -class curve joining the points and .
By we denote the space of all functions of -class with the norm
Now, we introduce the closed Lagrange 1-form density of -class as follows:
which determines the following path-independent curvilinear functionals:
where and , , are partial velocities.
The closedness conditions (complete integrability conditions) are and , , , , where is the total derivative.
The following result is useful to prove the main results in the paper.
Lemma 2.1 ([22])
A total divergence is equal to a total derivative.
We also accept that the Lagrange matrix density
of -class defines the partial differential inequalities (PDI) (of evolution)
and the Lagrange matrix density
defines the partial differential equalities (PDE) (of evolution)
In the paper, consider the vector of path-independent curvilinear functionals defined by
Denote by
the set all feasible solutions of problem (MVP), multitime multiobjective variational problem, introduced right now:
Multiobjective programming is the search for a solution that best manages trade-offs criteria that conflict and that cannot be converted to a common measure. An optimal solution to a multiobjective programming problem is ordinarily chosen from the set of all efficient solutions (Pareto optimal solutions) to it. Therefore, for multiobjective programming problems minimization means, in general, obtaining efficient solutions (Pareto optimal solutions) in the following sense.
Definition 2.1 A feasible solution is called an efficient solution for problem (MVP) if there is no other feasible solution such that
In other words, a feasible solution is called an efficient solution for problem (MVP) if there is no other feasible solution such that
and
By normal efficient solution we understand an efficient solution to the constraint problem which is not efficient for the corresponding program without taking into consideration the constraints.
Geoffrion [23] introduced the definition of properly efficient solution in order to eliminate the efficient solutions causing unbounded trade-offs between objective functions.
Definition 2.2 A feasible solution is called a properly efficient solution for problem (MVP) if it is efficient for (MVP) and if there exists a positive scalar M such that for all ,
for some j such that
whenever and
The following conditions established by Pitea et al. [14] are necessary for a feasible solution to be efficient in problem (MVP).
Theorem 2.1 Let be a normal efficient solution in the multitime multiobjective variational problem (MVP). Then there exist two vectors and the smooth matrix functions , such that
where .
We remark that relations (1) and (2) and the last relation in (3) hold true also for an efficient solution.
3 Proper efficiency results
Let be a path-independent curvilinear vector functional
We shall introduce a definition of univexity of the above functional, which will be useful to state the results established in the paper.
Let S be a nonempty subset of , be given, be a vector function such that , , and be an n-dimensional vector-valued function, vanishing at the point , and .
Definition 3.1 The vectorial functional A is called (strictly) univex at the point on S with respect to Φ, η and b if, for each , the following inequality
holds for all with .
Example 3.1 In the following, are functions of -class on .
Let . The functional is called invex at with respect to η if
A is univex at with respect to ϕ, η and b if
Clearly, any invex function is univex.
We consider .
The functional is not invex at with respect to
Indeed, consider . We get
so the invexity condition is not satisfied.
If we take , we obtain that A is univex with respect to ϕ, η, and , as follows:
which is always negative since .
Following this idea, non-invex functions for which the right-hand part of the invexity condition is negative become univex functions with the preservation of the same function η. The preservation of function η is important when we deal with several functionals which have to be univex with respect to the same η.
Now, we prove the sufficiency of efficiency for the feasible solution in problem (MVP) at which the above necessary optimality conditions are fulfilled. In order to prove this result, we use the concept of univexity defined above for a vectorial functional.
Theorem 3.1 Let be a feasible solution in the considered multitime multiobjective variational problem (MVP), and let the necessary optimality conditions (1)-(3) be satisfied at . Further, assume that the following hypotheses are fulfilled:
-
(a)
, , is strictly univex at the point on with respect to , η and ,
-
(b)
, , is univex at the point on with respect to , η and ,
-
(c)
, , is univex at the point on with respect to , η and ,
-
(d)
, , and ,
-
(e)
, ,
-
(f)
, ,
-
(g)
, ; , ; , .
Then is efficient in problem (MVP).
Proof Suppose, contrary to the result, that is not efficient in problem (MVP). Then there exists such that
Thus, for every ,
but for at least one ,
Since hypotheses (a)-(e) are fulfilled, therefore, by Definition 3.1, the following inequalities
and
and
are satisfied for all . Hence, they are also satisfied for .
Using hypotheses (d) and (f) together with (5) and (6), we get, for every ,
but for at least one ,
Combining relation (7) for together with (10) and (11), we obtain, for every ,
Multiplying each inequality above by , , and then adding both sides of the obtained inequalities, we get
Using together with the necessary optimality conditions (2) and (3), we get, for every ,
By assumption, we have
Since , , then
Combining (8) for and (14), we have, for every ,
Adding both sides of the inequalities above, we obtain
Using and together with hypothesis (f) and having in mind that , , we get
Combining (9) with and (16), we have, for every ,
Adding both sides of the inequalities above, we obtain
Adding both sides of inequalities (13), (15), (17), we get
We denote
Hence, (18) yields
Using the following relation
in inequality (20), we get
By Euler-Lagrange PDE (1), it follows that
For , , we denote
and
Combining (22), (23) and (24), we get
According to Lemma 2.1, it follows that there exists with and such that
Therefore, by (24) and (26), we have
contradicting (25). This means that is efficient in problem (MVP), and this completes the proof of the theorem. □
Theorem 3.2 Let be a feasible solution in the considered multitime multiobjective variational problem (MVP), and let the necessary optimality conditions (1)-(3) be satisfied at . Further, assume that hypotheses (a)-(g) in Theorem 3.1 are fulfilled.
If , then is properly efficient in problem (MVP).
Proof The proof follows in a manner similar to that of Theorem 3.1. □
4 Mond-Weir type duality
In this section, consider the vector of path-independent curvilinear functionals defined by
and define the following multiobjective dual problem in the sense of Mond-Weir for the considered multitime multiobjective variational problem (MVP):
where and , , are partial velocities.
Let be the set of all feasible solutions in the Mond-Weir type dual problem (MWDP), that is,
Let .
Theorem 4.1 (Weak duality)
Consider to be a feasible solution of problem (MVP) and to be a feasible solution of problem (MWDP).
Suppose that the following conditions are satisfied:
-
(a)
, , is univex at on with respect to , η, and ;
-
(b)
is univex at on with respect to Φ, η, and b;
-
(c)
, , and ;
-
(d)
;
-
(e)
, .
Then the inequality is false.
Proof Suppose for all . We obtain
and using hypothesis (a) and Definition 3.1, we get
We multiply (29) by and make the sum from to , obtaining
According to hypothesis (c), (28) and (30) imply
From the feasibility of in the considered multitime multiobjective variational problem (MVP), it follows that
while the feasibility of in the considered multitime multiobjective variational problem (MWDP) gives
Combining (32) and (33), we obtain
According to hypothesis (d), (34) implies
But , by consequence, the inequality above gives
Using hypothesis (b) together with Definition 3.1 and (35), we get that the inequality
holds. For each , we introduce
Adding both sides of (31) and (36) and taking into account (37), we obtain
Using the relation
together with the constraints of (MWDP), we obtain from (38) that the inequality
holds. According to Lemma 2.1, we obtain that the above integral is equal to 0, contradicting (40). This means that the inequality is false and completes the proof of the theorem. □
If we impose some stronger assumption on the objective function, then we can prove a stronger result.
Theorem 4.2 (Strong duality)
Let be a normal efficient solution of (MVP). Then there exist a vector in and smooth matrix functions and such that is feasible in the Mond-Weir multitime multiobjective variational problem (MWDP) and the objective functions of (MVP) and (MWDP) are equal at these points. If also all the hypotheses of Theorem 4.1 are satisfied, and , then is a properly efficient solution in (MWDP).
Proof Let be a normal efficient solution in the considered multitime multiobjective variational problem (MVP). Then, by Theorem 2.1, there exist the vector and the smooth matrix functions , such that conditions (1)-(3) are fulfilled. Therefore, is feasible in (MWDP). Thus, by weak duality, it follows that is an efficient solution in (MWDP).
We shall prove that is a properly efficient solution in (MWDP) by the method of contradiction. Suppose that is not so. Then there exists feasible in (MWDP) satisfying
for some i such that the following inequality
holds for every scalar and for each satisfying
Assume that , and then we set
Combining (41) and (43), we get that, for each ,
Thus, (42) gives
Adding both sides of the inequalities above with respect to j and taking into account that , we obtain
Thus, (42) implies that the following inequality
holds, which is a contradiction to the efficiency of in problem (MVP). This means that is a properly efficient solution in problem (MWDP). Hence, the proof of the theorem is complete. □
Proposition 4.1 Let be a feasible solution in problem (MWDP) with and . Assume that hypotheses (a)-(d) of Theorem 4.1 are satisfied and that condition (e) holds true for each .
Then is a properly efficient solution in the considered multitime multiobjective variational problem (MVP).
Proof The efficiency of in problem (MVP) follows from the weak duality theorem. The proof of proper efficiency of in (MVP) is similar to that of Theorem 4.2. □
Theorem 4.3 Let be a properly efficient solution in problem (MWDP) and . Assume that hypotheses (a)-(d) of Theorem 4.1 are satisfied and that condition (e) holds true for each .
Then is a properly efficient solution in the considered multitime multiobjective variational problem (MVP).
Proof Proof follows directly from Proposition 4.1. □
5 Wolfe type duality
In this section, consider the functional
and the associated multitime multiobjective variational dual problem of (MVP) in the sense of Wolfe, designated by (WDP):
where and , , are partial velocities.
Let be the set of all feasible solutions in the Wolfe type dual problem (WDP), that is,
Consider .
Theorem 5.1 (Weak duality)
Let and be feasible solutions in problem (MVP) and its multitime multiobjective variational Wolfe dual problem (WDP), respectively. Suppose that the following hypotheses are satisfied:
-
(a)
is strictly univex at point on with respect to Φ, η and b,
-
(b)
and ,
-
(c)
.
Then the inequality is false.
Proof Let and be feasible solutions in the considered multitime multiobjective variational problem (MVP) and the multitime variational Wolfe dual problem (WDP), respectively. Suppose, contrary to the result, that the inequality
holds. Thus, by the definition of φ, we have
for and
for some .
Multiplying (45) by , , and (46) by , we obtain, respectively,
for and
for some .
Using the feasibility of in problem (MVP) together with the constraint of (WDP) , we get
By (47), (48) and (49), it follows that
for and
for some .
Adding both sides of (50) and (49) and taking into account the constraint of (WDP) , we obtain
By hypotheses (b) and (c), (52) implies
By Definition 3.1, it follows
For each , we introduce
Combining (54) and (55), we obtain
The last part of the proof is similar to the proof of Theorem 4.1. Thus, in a similar manner as in the proof of Theorem 4.1, that is, by Lemma 2.1 we get a contradiction. Hence, the inequality is false. □
Theorem 5.2 (Strong duality)
Let be a normal efficient solution of (MVP). Then there exist the vector and the smooth matrix functions and such that is feasible in the Wolfe dual problem (WDP) and the objective functions of (MVP) and (WDP) are equal at these points. If also all the hypotheses of Theorem 5.1 are satisfied, then is a properly efficient solution in (WDP).
Proof Proof is similar to the proof of Theorem 4.2. □
Proposition 5.1 Let be feasible in the Wolfe multitime multiobjective variational problem (MWDP) and . Further, assume that the following hypotheses are satisfied:
-
(a)
is strictly univex at the point on with respect to Φ, η and b,
-
(b)
and ,
-
(c)
.
Then is a properly efficient solution in problem (MVP).
Theorem 5.3 (Converse duality)
Let be a properly efficient solution in the Wolfe dual problem (WDP) and . Further, assume that the following hypotheses are satisfied:
-
(a)
is univex at the point on with respect to Φ, η and b,
-
(b)
and ,
-
(c)
.
Then is a properly efficient solution in the considered multitime multiobjective variational problem (MVP).
6 Concluding remarks
In this research paper, a new class of nonconvex multitime variational problems has been considered. We have defined the concept of univexity for a path-independent curvilinear vector functional as a generalization of a vector-valued univex function. The so-called univex functions unify many various classes of generalized convex concepts in optimization theory. Therefore, the sufficient optimality conditions for proper efficiency and several duality theorems in the sense of Mond-Weir and in the sense of Wolfe, which have been established in the paper, for a new class of nonconvex multitime multiobjective variational problems extend adequate results already existing in optimization theory.
References
Chinchuluun A, Pardalos PM: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 2007, 154: 29–50. 10.1007/s10479-007-0186-0
Aghezzaf B, Khazafi K: Sufficient conditions and duality for multiobjective variational problems with generalized B -invexity. Control Cybern. 2004, 33: 113–126.
Ahmad I, Sharma S: Sufficiency and duality for multiobjective variational control problems with generalized - V -convexity. Nonlinear Anal. 2010, 72: 2564–2579. 10.1016/j.na.2009.11.005
Arana-Jiménez M, Rufián-Lizana A, Ruiz-Garzón G, Osuna-Gómez R: Efficient solutions in V - KT -pseudoinvex multiobjective control problems: a characterization. Appl. Math. Comput. 2009, 215: 441–448. 10.1016/j.amc.2009.05.060
Bector CR, Husain I: Duality for multiobjective variational problems. J. Math. Anal. Appl. 1992, 166: 214–229. 10.1016/0022-247X(92)90337-D
Bhatia D, Mehra A: Optimality conditions and duality for multiobjective variational problems with generalized B -invexity. J. Math. Anal. Appl. 1999, 234: 314–360.
Hachimi M, Aghezzaf B: Sufficiency and duality in multiobjective variational problems with generalized type I functions. J. Glob. Optim. 2006, 34: 191–218. 10.1007/s10898-005-1653-2
Mishra SK, Mukherjee RN: On efficiency and duality for multiobjective variational problems. J. Math. Anal. Appl. 1994, 187: 40–54. 10.1006/jmaa.1994.1343
Nahak C, Nanda S: Duality for multiobjective variational problems with invexity. Optimization 1996, 36: 235–248. 10.1080/02331939608844181
Nahak C, Nanda S:On efficiency and duality for multiobjective variational control problems with -convexity. J. Math. Anal. Appl. 1997, 209: 415–434. 10.1006/jmaa.1997.5332
Nahak C, Nanda S: Sufficient optimality criteria and duality for multiobjective variational control problems with V -invexity. Nonlinear Anal. 2007, 66: 1513–1525. 10.1016/j.na.2006.02.006
Chinchuluun A, Pardalos PM, Migdalas A, Pitsoulis L (Eds): Pareto Optimality, Game Theory and Equilibria. Springer, New York; 2008.
Udrişte C, Ţevy I: Multitime Euler-Lagrange-Hamilton theory. WSEAS Trans. Math. 2007, 6: 701–709.
Pitea A, Udrişte C, Mititelu Ş: PDI&PDE-constrained optimization problems with curvilinear functional quotients as objective vectors. Balk. J. Geom. Appl. 2009,14(2):75–88.
Pitea A, Udrişte C, Mititelu Ş: New type dualities in PDI and PDE constrained optimization problems. J. Adv. Math. Stud. 2009,2(2):81–90.
Bector CR, Suneja SK, Gupta S: Univex functions and univex nonlinear programming. Proceedings of the Administrative Sciences Association of Canada 1992, 115–124.
Hanson MA: On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 1981, 80: 545–550. 10.1016/0022-247X(81)90123-2
Antczak T: An η -approximation approach in nonlinear vector optimization with univex functions. Asia-Pac. J. Oper. Res. 2006, 23: 525–542. 10.1142/S0217595906001029
Popa M, Popa M: Mangasarian type higher-order duality for a class of nondifferentiable mathematical programming. Rev. Roum. Math. Pures Appl. 2004,49(2):163–172.
Mishra SK, Rueda N, Giorgi NG: Multiobjective programming under generalized type I univexity. An. Univ. Bucur., Mat. 2003,LII(2):207–224.
Khazafi K, Rueda N: Multiobjective variational programming under generalized type I univexity. J. Optim. Theory Appl. 2009, 142: 363–376. 10.1007/s10957-009-9526-3
Udrişte C, Dogaru O, Ţevy I: Null Lagrangian forms and Euler-Lagrange PDEs. J. Adv. Math. Stud. 2008,1(1–2):143–156.
Geoffrion AM: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 1968, 22: 618–630. 10.1016/0022-247X(68)90201-1