• 検索結果がありません。

3 Necessary efficiency conditions for the problem (MFP)

N/A
N/A
Protected

Academic year: 2022

シェア "3 Necessary efficiency conditions for the problem (MFP)"

Copied!
14
0
0

読み込み中.... (全文を見る)

全文

(1)

P DI&P DE -constrained optimization problems with curvilinear functional quotients as objective vectors

Ariana Pitea, Constantin Udri¸ste and S¸tefan Mititelu

Abstract. In this work we introduce and perform a study on the multi- time multi-objective fractional variational problem of minimizing a vector of quotients of path independent curvilinear integral functionals (M F P) subject to certain partial differential equations (P DE) and/or partial dif- ferential inequations (P DI), using a geometrical language. The paper is organized as follows: §1 formulates a P DI&P DE-constrained optimiza- tion problem.§2 states and proves necessary conditions for the optimality of the problem (M P) of minimizing a vector of path independent curvi- linear integral functionals constrained by P DIs and P DEs. §3 analyzes necessary efficiency conditions for the problem (M F P), and §4 studies different types of dualities.

M.S.C. 2000: 49J40, 49K20, 58E17, 65K10, 53C65.

Key words:P DI&P DEconstraints, multi-objective fractional variational problem, Pareto optimality, quasiinvexity, duality.

1 P DI&P DE-constrained optimization problem

Let (T, h) and (M, g) be Riemannian manifolds of dimensionspandn, respectively.

The local coordinates onT andM will be writtent= (tα) andx= (xi), respectively.

LetJ1(T, M) be the first order jet bundle associated to T andM.

To develop our theory, we recall the following relations between two vectorsv = (vj) andw= (wj),j = 1, a:

v=w vj=wj, j= 1, a; v < w vj< wj, j= 1, a;

v <=w vj≤wj, j= 1, a (product order relation).

v≤w v <=wandv6=w.

Using the product order relation on Rp, the hyperparallelepiped Ωt0,t1 Rp, with the diagonal opposite pointst0= (t10, . . . , tp0) andt1= (t11, . . . , tp1), can be written as the interval [t0, t1].

Balkan Journal of Geometry and Its Applications, Vol.14, No.2, 2009, pp. 65-78.

c

°Balkan Society of Geometers, Geometry Balkan Press 2009.

(2)

Now, we introduce theC-class Lagrange 1-forms densities

fα= (fα`) :J1(T, M)Rr, kα= (kα`) :J1(T, M)Rr, `= 1, r, α= 1, p.

Suppose thatDβfα` =Dαfβ`, and Dβk`α=Dαk`β,α, β= 1, p, α6=β, `= 1, r, where Dβis the total derivative (closeness conditions, complete integrability conditions) and

Z

γt0,t1

kα`(t, x(t), xγ(t))dtα>0,

wherexγ(t) = ∂x

∂tγ(t),γ= 1, p, are partial velocities andγt0,t1 is a piecewiseC1-class curve joining the pointst0 and t1. The closed Lagrange 1-forms densitiesfα` andk`α will be used to define certain quotients of curvilinear integral functionals. Also we accept that the Lagrange matrix density

g= (gba) :J1(T, M)Rms, a= 1, s, b= 1, m, m < n, ofC-class defines the partial differential inequations (P DI) (of evolution) (1.1) g(t, x(t), xγ(t))<= 0, t∈t0,t1,

and the Lagrange matrix density

h= (hba) :J1(T, M)Rqs, a= 1, s, b= 1, q, q < n, defines the partial differential equation (P DE) (of evolution)

(1.2) h(t, x(t), xγ(t)) = 0, t∈t0,t1.

The purpose of this work is to study the multitime multi-objective fractional vari- ational problem of minimizing a vector of quotients of path independent curvilinear functionals



 Z

γt0,t1

fα1(t, x(t), xγ(t))dtα Z

γt0,t1

kα1(t, x(t), xγ(t))dtα , . . . ,

Z

γt0,t1

fαr(t, x(t), xγ(t))dtα Z

γt0,t1

krα(t, x(t), xγ(t))dtα



,

knowing that the functionx(t) satisfies the boundary conditionsx(t0) =x0,x(t1) = x1, or x(t)|∂Ωt0,t1 = given, the partial differential inequations of evolution (1.1), and the partial differential equation of evolution (1.2). Such a problem is called P DI&P DE-constrained optimization problem(see also [2]-[8], [10], [11], [19], [20]).

Introducing the notations F`(x(·)) =

Z

γt0,t1

fα`(t, x(t), xγ(t))dtα, K`(x(·)) = Z

γt0,t1

k`α(t, x(t), xγ(t))dtα, the above-mentioned extremizing problem can be written

(3)

(M F P)















 minx(·)

µF1(x(·))

K1(x(·)), . . . ,Fr(x(·)) Kr(x(·))

subject to

x(t0) =x0, x(t1) =x1, g(t, x(t), xγ(t))<

= 0, t∈t0,t1, h(t, x(t), xγ(t)) = 0, t∈t0,t1.

LetC(Ωt0,t1, M) be the space of all functionsx: Ωt0,t1 →M of C-class, with the norm

kxk=kxk+ Xp

α=1

kxαk. The set

F(Ωt0,t1) ={x∈C(Ωt0,t1, M)|x(t0) =x0, x(t1) =x1, g(t, x(t), xγ(t))<= 0, h(t, x(t), xγ(t)) = 0, tt0,t1}

is called theset of all feasible solutionsof the problem (M F P).

Partial differential inequations/equations mathematically represent a multitude of natural phenomena, and in turn, applications in science and engineering ubiquitously give rise to problems formulated asP DI&P DE-constrained optimization. The areas of research who strongly motivate theP DI&P DE-constrained optimization include:

shape optimization in fluid mechanics and medicine, material inversion - in geophysics, data assimilation in regional weather prediction modelling, structural optimization, and optimal control of processes.P DI&P DE-constrained optimization problems are generally infinite dimensional in nature, large and complex. As a result, this class of optimization problems present significant reasoning and computational challenges, many of which have been studied in recent years in Germany, USA, Romania, etc.

As computing power grows and optimization techniques become more advanced, one wonders whether there are enough commonalities among P DI&P DE-constrained optimization problems from different fields to develop ratiocinations and algorithms for more than a single application. This question has been the topic of many papers, conferences and recent scientific grants.

The basic optimization problems of path independent curvilinear integrals with P DE constraints or with isoperimetric constraints, expressed by the multiple inte- grals or path independent curvilinear integrals, were stated for the first time in our works [12]-[18]. The papers [15], [17], [18] focuss onmultitime maximum principlein multitime optimal control problems.

2 Necessary conditions of optimality

In order to obtain necessary conditions for the optimality of the problem (M F P), we start with a vector of path independent curvilinear functionals,

F(x(·)) = Z

γt0,t1

fα(t, x(t), xγ(t))dtα= µ Z

γt0,t1

fα1(t, x(t), xγ(t))dtα, . . . , Z

γt0,t1

fαr(t, x(t), xγ(t))dtα

= (F1(x(·)), . . . , Fr(x(·))),

(4)

and we formulate a simplifiedP DI&P DE-constrained minimum problem

(M P)













minx(·) F(x(·)) subject to

x(t0) =x0, x(t1) =x1, g(t, x(t), xγ(t))<

= 0, t∈t0,t1, h(t, x(t), xγ(t)) = 0, t∈t0,t1.

We are interested in finding necessary conditions for the optimality, respectively efficiency conditions, for the problem (M P) in the domainF(Ωt0,t1).

Definition 2.1. A feasible solution x(·)∈ F(Ωt0,t1) is calledefficient pointfor the program (M P) if and only if for any feasible solutionx(·)∈ F(Ωt0,t1), the inequality F(x(·))<

=F(x(·)) implies the equalityF(x(·)) =F(x(·)).

To analyze the previous problem, we start with the case of a single functional.

Let s = (sα) : J1(Ωt0,t1, M) Rp be a closed Lagrange 1-form density of C- class which produces the action S(x(·)) =

Z

γt0,t1

sβ(t, x(t), xγ(t))dtβ. Consider the followingP DI&P DE-constrained variational problem

(SP)









minx(·) S(x(·)) subject to g(t, x(t), xγ(t))<

= 0, t∈t0,t1, h(t, x(t), xγ(t)) = 0, t∈t0,t1. We define the auxiliary Lagrange density 1-formL= (Lα) as

Lα(t, x(t), xγ(t), λ, µ(t), ν(t)) =λsα(t, x(t), xγ(t))+< µα(t), g(t, x(t), xγ(t))>

+< να(t), h(t, x(t), xγ(t))>, α= 1, p,

where λ is real number and µ(t) = (µα(t)) = (µaαb(t)), ν = (να(t)) = (ναba (t)) are Lagrange multipliers subject to the condition that the 1-form L = (Lα) is closed.

Extending the results in [15], [18], the necessary conditions for the optimality of a feasible solutionx(·)∈ F(Ωt0,t1) in the problem (SP) are









∂Lα

∂x (t, x(t), xγ(t))−Dγ∂Lα

∂xγ(t, x(t), xγ(t)) = 0, α= 1, p (Euler-Lagrange PDE)

< µα(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, µα(t)>

= 0, t∈t0,t1, α= 1, p.

Definition 2.2. Ifλ6= 0, the optimal feasible solutionx(·) of the problem (SP) is callednormal.

Without loss of generality, if x(·) is an optimal normal solution of the problem (SP), we can assume thatλ= 1.

The following Theorem describes the previous necessary optimality conditions in the language of [4], [15], [18], [19].

(5)

Theorem 2.3. Lets= (sα)be a closed1-form ofC-class. Ifx(·)∈ F(Ωt0,t1)is a normal optimal solution of the problem (SP), then there exist the multipliersλ,µ(t), ν(t)satisfying the following conditions:

(V C)



































λ∂sα

∂x (t, x(t), xγ(t))+< µα(t),∂g

∂x(t, x(t), xγ(t))>

+< να(t),∂h

∂x(t, x(t), xγ(t))>−Dγ

µ λ∂sα

∂xγ(t, x(t), xγ(t)) +< µα(t), ∂g

∂xγ(t, x(t), xγ(t))>+< να(t), ∂h

∂xγ(t, x(t), xγ(t))>

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< µα(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, µα(t)>

= 0, t∈t0,t1, α= 1, p, [λ= 1].

Now we turn back to the vector problem (M P). To develop further our theory, we need the result in the following Lemma (for the single-time case, see [3]).

Lemma 2.4. The function x(·)∈ F(Ωt0,t1) is an efficient solution of the problem (MP) if and only if x(·) is an optimal solution of each scalar problem P`(x(·)),

`= 1, r, where

P`(x)

















minx(·) F`(x(·)) subject to

x(t0) =x0, x(t1) =x1, g(t, x(t), xγ(t))<

= 0, t∈t0,t1, h(t, x(t), xγ(t)) = 0, t∈t0,t1, Fj(x(·))≤Fj(x(·)), j = 1, r, j6=`.

Proof. In order to prove the direct implication, we suppose that the func- tion x(·)∈ F(Ωt0,t1) is an efficient solution of the problem (M P) and there is k∈ {1, . . . , r} such that x(·) ∈ F(Ωt0,t1) is not an optimal solution of the scalar problemPk(x(·)). Then there exists a functiony(·)∈ F(Ωt0,t1) such that

Fj(y(·))≤Fj(x(·)), j= 1, r, j6=k; Fk(y(·))< Fk(x(·)).

These relations contradict the efficiency of the function x(·) ∈ F(Ωt0,t1) for the problem (M P). Consequently, the pointx(·)∈ F(Ωt0,t1) is an optimal solution for each programP`(x(·)),`= 1, r.

Conversely, let us consider that the function x(·)∈ F(Ωt0,t1) is an optimal so- lution of all problemsP`(x(·)), ` = 1, r. Suppose that x(·) ∈ F(Ωt0,t1) is not an efficient solution of the problem (M P). Then there exists a functiony(·)∈ F(Ωt0,t1) such that Fj(y(·))≤Fj(x(·)), j = 1, r, and there is k ∈ {1, . . . , r} such that Fk(y(·)) < Fk(x(·)). This is a contradiction to the assumption that the function x(·)∈ F(Ωt0,t1) minimizes the functionalFk(x(·)) on the set of all feasible solutions of problemPk(x(·)). Therefore, the functionx(·)∈ F(Ωt0,t1) is an efficient solution of the problem (M P)

(6)

Lemma 2.5. Let ` be fixed between 1 and r. If the function x(·)∈ F(Ωt0,t1) is a [normal] optimal solution of the scalar problemP`(x(·)), then there exist the real vec- torsj`),j= 1, r, and the matrix functionsµ``, such that the following conditions are satisfied

λj`∂fαj

∂x (t, x(t), xγ(t))+< µ(t),∂g

∂x(t, x(t), xγ(t))>

+< ν(t),∂h

∂x(t, x(t), xγ(t))>−Dγ

µ λj`∂fαj

∂xγ(t, x(t), xγ(t)) +< µ(t), ∂g

∂xγ

(t, x(t), xγ(t))>+< ν(t), ∂h

∂xγ

(t, xγ(t), xγ(t))>

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< µ(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, µ(t)>

= 0, t∈t0,t1, α= 1, p, λj`0 [λ``= 1].

For a proof, see [9].

Definition 2.6. The function x(·)∈ F(Ωt0,t1) is callednormal efficient solution of the problem (MP) if it is normal optimal solution for at least one of the problems P`(x(·)),`= 1, r.

It follows the main result of this section.

Theorem 2.7. Ifx(·)∈ F(Ωt0,t1)is a normal efficient solution of the problem (MP), then there exist a vector λ Rr and the smooth matrix functions µ(t) = (µα(t)), ν(t) = (να(t)), which satisfy the following conditions

(M V)







































< λ,∂fα

∂x(t, x(t), xγ(t))>+< µα(t),∂g

∂x(t, x(t), xγ(t))>

+< να(t),∂h

∂x(t, x(t), xγ(t))>−Dγ µ

< λ,∂fα

∂xγ(t, x(t), xγ(t))>

+< µα(t), ∂g

∂xγ(t, x(t), xγ(t))>+< να(t), ∂h

∂xγ(t, x(t), xγ(t))>

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< µα(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, µα(t)>= 0, t∈t0,t1, α= 1, p,

λ0,

< e, λ>= 1, e= (1, . . . ,1)Rr.

Proof. If the functionx(·)∈ F(Ωt0,t1) is a [normal] efficient solution of the prob- lem (M P), according to Lemma 2.4, the pointx(·)∈ F(Ωt0,t1) is a normal efficient solution of each scalar problemP`(x(·)), ` = 1, r. According to Lemma 2.5, there exist the matrix λj`, j, `= 1, r, and the functions µ, ν, satisfying the following conditions

(7)

(F V)`





































λj`

∂fαj

∂x (t, x(t), xγ(t))+< µ(t),∂g

∂x(t, x(t), xγ(t))>

+< ν(t),∂h

∂x(t, x(t), xγ(t))>−Dγ

µ λj`∂fαj

∂xγ(t, x(t), xγ(t)) +< µ(t), ∂g

∂xγ

(t, x(t), xγ(t))>+< ν, ∂h

∂xγ

(t, x(t), xγ(t))>

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< µ(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, µ(t)>= 0, t∈t0,t1, α= 1, p,

λj`0 [λ``= 1].

Making the sum of all relations (F V)` from`= 1 to`=rand denoting Λj=

Xr

`=1

λj`, Mα(t) = Xr

`=1

µ(t), Nα(t) = Xr

`=1

ν(t), the following relations are obtained

(F V)



































Λj∂fαj

∂x (t, x(t), xγ(t))+< Mα(t),∂g

∂x(t, x(t), xγ(t))>

+< Nα(t),∂h

∂x(t, x(t), xγ(t))>−Dγ

µ Λj∂fαj

∂xγ(t, x(t), xγ(t)) +< Mα(t), ∂g

∂xγ(t, x(t), xγ(t))>+< Nα(t), ∂h

∂xγ(t, x(t), xγ(t))>

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< Mα(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, Mα(t)>= 0, t∈t0,t1, α= 1, p,

λj0, j= 1, r.

We divide the relations (F V) byS= Xr

j=1

Λj 1 and we denote

Λjj

S , Mα(t) =Mα(t)

S , Nα(t) = Nα(t)

S .

Thus we obtain the relations from the statement

3 Necessary efficiency conditions for the problem (MFP)

Consider x(·)∈ F(Ωt0,t1) being a feasible solution of the problem (M F P) and for each indexj between 1 andr, let us introduce the real number

Rj(x(·)) = Fj(x(·)) Kj(x(·)).

(8)

For a fixed index`, we consider the following pair of extremizing problems

(F P R)`



















 minx(·)

F`(x(·)) K`(x(·)) subject to

x(t0) =x0, x(t1) =x1

g(t, x(t), xγ(t))<= 0, t∈t0,t1, h(t, x(t), xγ(t)) = 0, t∈t0,t1, Fj(x(·))−Rj(x(·))Kj(x(·))<

= 0, j= 1, r, j6=`.

(SP R)`

















minx(·) F`(x(·))−R`(x(·))K`(x(·)) subject to

x(t0) =x0, x(t1) =x1

g(t, x(t), xγ(t))<

= 0, t∈t0,t1, h(t, x(t), xγ(t)) = 0, t∈t0,t1,

Fj(x(·))−Rj(x(·))Kj(x(·))<= 0, j = 1, r, j6=`, With the statements of Jagannathan [3], we have

Lemma 3.1. The functionx(·)∈ F(Ωt0,t1) is optimal in(F P R)` if and only if it is optimal in(SP R)`,`= 1, r.

Using Lemma 2.4 and Lemma 3.1, we can formulate

Theorem 3.2. The functionx(·)∈ F(Ωt0,t1)is an efficient solution for the problem (MFP) if and only if it is an optimal solution for each problem(SP R)`,`= 1, r.

Proof. We shall prove this statement using the double implication.

The necessity. Let us suppose that the function x(·) ∈ F(Ωt0,t1) is efficient for the problem (M F P). Then it is optimal for problem (F P R)`,`= 1, r, according to Lemma 2.4. Also, for any ` = 1, r, if the function x(·) ∈ F(Ωt0,t1) is optimal for problem (F P R)`, then it is optimal for problem (SP R)`, ` = 1, r (according to Lemma 3.1).

The sufficiency. Let us suppose that the function x(·) ∈ F(Ωt0,t1) is effi- cient for the problem (SP R)`, for all`= 1, r. Then it is optimal for problem (F P R)`,

`= 1, r, according to Lemma 3.1. Also, for any`= 1, r, the functionx(·)∈ F(Ωt0,t1) is optimal for problem (F P R)`, therefore it is optimal for problem (M P F) (according to Lemma 2.4)

Remark. The function x(·) ∈ F(Ωt0,t1) is a normal efficient solution of the problem (M F P) if it is a normal optimal solution for at least one of the scalar problems (F P R)`,`= 1, r.

Consider λ = (λ1, . . . , λr) Rr and the matrix functions µ: Ωt0,t1 Rmsp, ν: Ωt0,t1 Rqspsuch that the auxiliary Lagrange 1-formL= (Lα),

Lα(t, x(t), xγ(t), λ, µ(t), ν(t)) =λj

¡fαj(t, x(t), xγ(t))−Rj(x(·))kαj(t, x(t), xγ(t))¢ +< µα(t), g(t, x(t), xγ(t))>

+< να(t), h(t, x(t), xγ(t))>, α= 1, p,

(9)

be closed. Having in mind the background introduced above, we can state the main results of this section. First of all, we shall introduce our necessary efficiency condi- tions.

Theorem 3.3 (Necessary efficiency conditions). Let the function x(·) F(Ωt0,t1)be a normal efficient solution of problem(M F P). Then there existΛ1◦,Λ2◦ Rr and the smooth functions M: Ωt0,t1 Rmsp, N: Ωt0,t1 Rspq, such that we have

(M F V)





















































Λ1◦j ∂fαj

∂x (t, x(t), xγ(t))Λ2◦j ∂kjα

∂x (t, x(t), xγ(t)) +< Mα(t),∂g

∂x(t, x(t), xγ(t))>+< Nα(t),∂h

∂x(t, x(t), xγ(t))>

−Dγ

½ Λ1◦j ∂fαj

∂xγ(t, x(t), xγ(t))Λ2◦j ∂kαj

∂xγ(t, x(t), xγ(t)) +< Mα(t, x(t), xγ(t)), ∂g

∂xγ(t, x(t), xγ(t))>

+< Nα(t), ∂h

∂xγ(t, x(t), xγ(t))>

¾

= 0,

t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< Mα(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, Mα(t)>

= 0, t∈t0,t1, α= 1, p,

Λ1◦0, < e,Λ1◦>= 1, e= (1, . . . ,1)Rr.

Proof. There areλ1j`,λ2j`,j= 1, r, and the functionsµ(t),ν(t), such that

(F V)`













































λ1j`∂fαj

∂x (t, x(t), xγ(t))−λ2j`∂kjα

∂x (t, x(t), xγ(t))

¸

+< µ(t),∂g

∂x(t, x(t), xγ(t))>+< ν(t),∂h

∂x(t, x(t), xγ(t))>

−Dγ

½ λ1j`∂fαj

∂xγ(t, x(t), xγ(t))−λ2j`∂kjα

∂xγ(t, x(t), xγ(t)) +< µ(t), ∂g

∂xγ

(t, x(t), xγ(t))>+< ν(t), ∂h

∂xγ

(t, x(t), xγ(t))>

¾

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

< µ(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, µ(t)>

= 0, t∈t0,t1, α= 1, p, λj`0 [λ``= 1].

We make the sum of all relations (F V)` after`= 1, rand denoting Λ¯1j =

Xr

`=1

λ1j`, Λ¯2j = Xr

`=1

λ2j`, M¯α(t) = Xr

`=1

µ(t), N¯α(t) = Xr

`=1

ν(t) we obtain

(10)

(F V)













































Λ¯1j∂fαj

∂x(t, x(t), xγ(t))Λ¯2j∂kjα

∂x (t, x(t), xγ(t)) +<M¯α(t),∂g

∂x(t, x(t), xγ(t))>+<N¯α(t),∂h

∂x(t, x(t), xγ(t))>

−Dγ

½ Λ¯1j

·∂fαj

∂xγ(t, x(t), xγ(t))Λ¯2j∂kαj

∂xγ(t, x(t), xγ(t)) +<M¯α(t), ∂g

∂xγ(t, x(t), xγ(t))>+<N¯α(t), ∂h

∂xγ(t, x(t), xγ(t))>

¾

= 0, t∈t0,t1, α= 1, p (Euler-Lagrange PDEs)

<M¯α(t), g(t, x(t), xγ(t))>= 0, t∈t0,t1, α= 1, p, M¯α(t)>

= 0, t∈t0,t1, α= 1, p, Λ¯1j 0.

Dividing the relations (F V) byS= Xr

j=1

Λ¯1j 1 and denoting

Λ1◦j =Λ¯1j

S , Λ2◦j = Λ¯2j

S , Mα(t) =M¯α(t)

S , Nα(t) = N¯α(t)

S ,

the relations (F V) take the form (M F V)

4 A dual program theory

Letρ be a real number andb:C(Ωt0,t1, M)×C(Ωt0,t1, M)[0,∞) a func- tional. Leta = (aα) be a closed Lagrange 1-form. We associate the path indepen- dent curvilinear functional A(x(·)) =

Z

γt0,t1

aα(t, x(t), xγ(t))dtα. The definition of the quasiinvexity (see also [2], [7], [10], [11], [20]) helps us to state the results included in this section.

Definition 4.1. The functional A is called [strictly] (ρ, b)-quasiinvex at the point x(·) if there is a vector function η: J1(Ωt0,t1, M)×J1(Ωt0,t1, M) Rn, vanish- ing at the point (t, x(t), xγ(t), x(t), xγ(t)), and the functional θ:C(Ωt0,t1, M)× C(Ωt0,t1, M)→Rn,such that for any x(·) [x(·)6=x(·)], the following implication holds

(A(x(·))<=A(x(·))) Ã

b(x(·), x(·)) Z

γt0,t1

{< η(t, x(t), xγ(t), x(t), xγ(t)),

∂aα

∂x (t, x(t), xγ(t))>+< Dγη(t, x(t), xγ(t), x(t), xγ(t)),

∂aα

∂xγ(t, x(t), xγ(t))>}dtα[<]<= −ρb(x(·), x(·))kθ(x(·), x(·))k2

. We associate a multi-objective variational dual problem to the problem (M F P), preserving the same set of feasible solutions:

(11)

(M F D)



























































 maxy(·)

µF1(y(·))

K1(y(·)), . . . ,Fr(y(·)) Kr(y(·))

subject to

y(t0) =x0, y(t1) =x1

Λ1◦` ∂fα`

∂y (t, y(t), yγ(t))Λ2◦` ∂kα`

∂y (t, y(t), yγ(t)) +< µα(t),∂g

∂y(t, y(t), yγ(t))>+< να(t),∂h

∂y(t, y(t), yγ(t))>

−Dγ

½ Λ1◦` ∂fα`

∂yγ(t, y(t), yγ(t))−Λ2◦` ∂kα`

∂yγ(t, y(t), yγ(t)) +< µα(t), ∂g

∂yγ(t, y(t), yγ(t))>+< να(t), ∂h

∂yγ(t, y(t), yγ(t))>

¾

= 0, t∈t0,t1, α= 1, p

< µα(t), g(t, y(t), yγ(t))>+< να(t), h(t, y(t), yγ(t))> >= 0, α= 1, p, tt0,t1

Λ1◦0, < e,Λ1◦>= 1, e= (1, . . . ,1)Rr.

To formulate our original results, we use the minimizing functional vectorπ(x(·)) of the problem (M F D) at the pointx(·)∈ F(Ωt0,t1) and the maximizing functional vector

δ(y(·), yγ(·),Λ1◦,Λ2◦, µ(·), ν(·)) of the dual problem (M F D) at

(y(·), yγ(·),Λ1◦,Λ2◦, µ(·), ν(·))∈∆, where ∆ is the domain of the problem (M F D).

Theorem 4.2 (Weak duality). Let x(·) be a feasible solution of the problem (M F P)andy(·)be a normal efficient solution of the dual problem(M F D). Assume that the following conditions are fulfilled:

a) Λ1◦` >0,Λ2◦` >0,`= 1, r, Λ1◦` F`(y(·))Λ2◦` K`(y(·)) = 0;

b) for any` = 1, r, the functionalF`(x(·))is0`, b)-quasiinvex at the point y(·) and−K`(x(·))is00`, b)-quasiinvex at the pointy(·)with respect toη andθ;

c) the functional Z

γt0,t1

[< µα(t), g(t, x(t), xγ(t))>+< να(t), h(t, x(t), xγ(t))>]dtα is000, b)- quasiinvex aty(·)with respect toη andθ;

d)one of the functionals of b),c)is strictly0`, b)-quasiinvex;

e) ρ0`Λ1◦` +ρ00`Λ2◦` +ρ000 >

= 0.

Then, the inequalityπ(x(·))≤δ(y(·), yγ(·),Λ1◦,Λ2◦, µ(·), ν(·))is false.

The proof will be given in a further paper (see also, [9]).

Theorem 4.3 (Direct duality). Letx(·)∈ F(Ωt0,t1)be a normal efficient solution of(M F P)and suppose that the hypotheses of Theorem4.2are satisfied. Then there are

参照

関連したドキュメント