Abstract

We use 𝜌(𝜂,𝜃)-𝐵-type-I and generalized 𝜌(𝜂,𝜃)-𝐵-type-I functions to establish sufficient optimality conditions and duality results for multiobjective variational problems. Some of the related problems are also discussed.

1. Introduction

The relationship between mathematical programming and classical calculus of variation was explored and extended by Hanson [1]. Thereafter variational programming problems have some attention in the literature. Mond and Hanson [2] obtained optimality conditions and duality results for scalar valued variational problems under convexity assumptions. Motivated by the approach by Bector and Husain [3], Nahak and Nanda [4] and later Bhatia and Mehra [5] extended the results of Mond et al. [6] to multiobjective variational problems involving invex functions and generalized 𝐵-invex functions, respectively. Analogous results were developed by Zalmai [7] for fractional variational programming problem containing arbitrary norms and by Liu [8] for generalized fractional case involving (𝐹,𝜌)-convex functions.

Type-I functions were first introduced by Hanson and Mond [9], and Rueda and Hanson [10] defined a class of pseudo-type-I and quasi-type-I functions as generalization of type-I functions. Bhatia and Mehra [5] studied the optimality conditions and duality results for multiobjective variational problems involving generalized 𝐵-invexity. We use 𝜌(𝜂,𝜃)-𝐵-type-I and generalized 𝜌(𝜂,𝜃)-𝐵-type-I functions to establish sufficient optimality conditions and duality results for multiobjective variational problems.

In Section 2 of this paper, we introduce 𝜌(𝜂,𝜃)-𝐵-type-I and generalized 𝜌(𝜂,𝜃)-𝐵-type-I functions for the continuous case. Using these new classes of functions, we establish various sufficient optimality conditions in Section 3 of this paper. Section 4 is devoted to the duality results. Some related problems are discussed in Section 5. The results obtained in this paper are more general than those obtained in [4, 5, 11].

Let 𝐼=[𝑎,𝑏] be a real interval, let 𝑓𝐼×𝑛×𝑛𝑝, and let 𝐼×𝑛×𝑛𝑚 be continuously differentiable functions with respect to their arguments and 𝑥𝐼𝑛, ̇𝑥 denotes the derivative of 𝑥 with respect 𝑡. Denote the partial derivative of scalar valued function 𝑔𝐼×𝑛×𝑛, with respect to 𝑡, 𝑥, and ̇𝑥, respectively, by 𝑔𝑡, 𝑔𝑥, and 𝑔̇𝑥 such that 𝑔𝑥=[𝜕𝑔/𝜕𝑥1,,𝜕𝑔/𝜕𝑥𝑛], 𝑔̇𝑥=[𝜕𝑔/𝜕̇𝑥1,,𝜕𝑔/𝜕̇𝑥𝑛]. Similarly we write the partial derivative of the vector functions 𝑓 and using matrices with 𝑝 and 𝑚 rows, respectively, instead of one. Let 𝐶(𝐼,𝑛) denote the space of piecewise smooth functions 𝑥 with norm 𝑥=𝑥+𝐷𝑥, where the differential operator 𝐷 is given by 𝑢=𝐷𝑥𝑥(𝑡)=𝑥(𝑢)+𝑡𝑎𝑢(𝑠)𝑑𝑠.(1) Therefore, 𝐷=𝑑/𝑑𝑡 except at discontinuities.

Consider the following multiobjective variational problem: (𝑉𝑃)minimize𝑏𝑎=𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡,𝑏𝑎𝑓1(𝑡,𝑥,̇𝑥),,𝑏𝑎𝑓𝑝(𝑡,𝑥,̇𝑥)subjectto𝑥(𝑎)=𝛼,𝑥(𝑏)=𝛽,(𝑡,𝑥,̇𝑥)0,𝑡𝐼.(2) Let 𝐾={𝑥𝐶(𝐼,𝑛)𝑥(𝑎)=𝛼,𝑥(𝑏)=𝛽,(𝑡,𝑥,̇𝑥)0,𝑡𝐼}.

Efficiency and proper efficiency are defined in their usual sense as defined in [4].

In relation to (𝑉𝑃), we introduce the following multiobjective problem (𝑃𝑘), for each 𝑘=1,,𝑝, each problem with single objective: 𝑃𝑘Minimize𝑏𝑎𝑓𝑘(𝑡,𝑥,̇𝑥)𝑑𝑡Subjectto𝑥(𝑎)=𝛼,𝑥(𝑏)=𝛽,𝑏𝑎𝑓𝑖(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓𝑖𝑡,𝑥,̇𝑥𝑑𝑡,𝑖=1,2,,𝑝,𝑖𝑘,𝑗(𝑡,𝑥,̇𝑥)0,𝑗=1,,𝑚,𝑡𝐼.(3)

The following lemma can be established on the lines of Chankong and Haimes [12].

Definition 1 (see [4]). A point 𝑥 in 𝐾 is said to be an efficient solution of (𝑉𝑃) if for all 𝑥𝐾𝑏𝑎𝑓𝑖𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝑓𝑖(𝑡,𝑥,̇𝑥)𝑑𝑡,𝑖{1,,𝑝},𝑏𝑎𝑓𝑖𝑡,𝑥,̇𝑥𝑑𝑡=𝑏𝑎𝑓𝑖(𝑡,𝑥,̇𝑥)𝑑𝑡,𝑖{1,,𝑝}.(4)

Definition 2 (see [13]). A point 𝑥 in 𝐾 is said to be a properly efficient solution of (𝑉𝑃) if for all 𝑥𝐾 there exists a scalar 𝑀>0 such that for all 𝑖{1,,𝑝}𝑏𝑎𝑓𝑖𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝑓𝑖(𝑡,𝑥,̇𝑥)𝑑𝑡,𝑖{1,,𝑝},𝑀𝑏𝑎𝑓𝑗(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓𝑗𝑡,𝑥,̇𝑥𝑑𝑡(5) for some 𝑗 such that 𝑏𝑎𝑓𝑗(𝑡,𝑥,̇𝑥)𝑑𝑡>𝑏𝑎𝑓𝑗𝑡,𝑥,̇𝑥𝑑𝑡(6) whenever 𝑥 is in 𝐾 and 𝑏𝑎𝑓𝑗(𝑡,𝑥,̇𝑥)𝑑𝑡<𝑏𝑎𝑓𝑗𝑡,𝑥,̇𝑥𝑑𝑡.(7)

Lemma 3. 𝑥 is an efficient solution of (𝑉𝑃) if and only if 𝑥 is an optimal solution of (𝑃𝑘) for each 𝑘=1,2,,𝑝.

Theorem 4 (see [2]). For every optimal normal solution of (𝑃𝑘), for each 𝑘=1,2,,𝑝, there exist real numbers 𝜆1𝑘,,𝜆𝑝𝑘 with 𝜆𝑘𝑘=1 and piecewise smooth function 𝑦𝑘𝐼𝑚 such that 𝑓𝑘𝑥𝑡,𝑥,̇𝑥+𝑝𝑖=1𝑖𝑘𝜆𝑖𝑘𝑓𝑖𝑥𝑡,𝑥,̇𝑥+𝑦𝑘(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥=𝑑𝑓𝑑𝑡𝑘̇𝑥𝑡,𝑥,̇𝑥+𝑝𝑖=1𝑖𝑘𝜆𝑖𝑘𝑓𝑖̇𝑥𝑡,𝑥,̇𝑥+𝑦𝑘(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥,𝑦𝑘(𝑡)𝑇𝑡,𝑥,̇𝑥𝑦=0,𝑡𝐼,𝑘𝜆(𝑡)0,𝑡𝐼,𝑖𝑘0,𝑖=1,2,,𝑝,𝑖𝑘.(8)

2. 𝜌(𝜂,𝜃)-𝐵-Type-I and Generalized 𝜌(𝜂,𝜃)-𝐵-Type-I Functions

Definition 5. Let  𝑓 and be real valued functions. A pair  (𝑓,) is said to be (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃 if there exist functions 𝑏0, 𝑏1𝐶(𝐼,𝑛)×𝐶(𝐼,𝑛)+ and 𝜂, 𝜃𝐼×𝑛×𝑛𝑛 with 𝜂(𝑡,𝑥,𝑥)=0, 𝜌0,𝜌1 such that for all 𝑥𝐾𝑏0(𝑥,𝑢)𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑓𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝜌0𝜃(𝑡,𝑥,𝑢)2𝑑𝑡,(9)𝑏1(𝑥,𝑢)𝑏𝑎(𝑡,𝑢,̇𝑢)𝑑𝑡𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑥(𝑑𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(𝑡,𝑥,𝑢)2𝑑𝑡.(10) If, in the previous definition, (9) is satisfied as a strict inequality, then we say that a pair (𝑓,) is (𝜌0,𝜌1)(𝜂,𝜃)𝐵-semistrictly-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃 and 𝜌0,𝜌1.

Definition 6. A pair (𝑓,) is said to be (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-quasi-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, 𝜃 if there exist functions 𝑏0, 𝑏1𝐶(𝐼,𝑛)×𝐶(𝐼,𝑛)+ and 𝜂, 𝜃𝐼×𝑛×𝑛𝑛 with 𝜂(𝑡,𝑥,𝑥)=0, 𝜌0,𝜌1 such that for all 𝑥𝐾𝑏0(𝑥,𝑢)𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡0𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑓𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝜌0𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0,𝑏1(𝑥,𝑢)𝑏𝑎(𝑡,𝑢,̇𝑢)𝑑𝑡0,𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(t,𝑥,𝑢)2𝑑𝑡0.(11)

Definition 7. A pair (𝑓,) is said to be (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I at  𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃 if there exist functions 𝑏0, 𝑏1𝐶(𝐼,𝑛)×𝐶(𝐼,𝑛)+ and 𝜂, 𝜃𝐼×𝑛×𝑛𝑛 with 𝜂(𝑡,𝑥,𝑥)=0, 𝜌0,𝜌1 such that for all 𝑥𝐾, 𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑓𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝜌0𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0𝑏0(𝑥,𝑢)𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡0,𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0𝑏1(𝑥,𝑢)𝑏𝑎(𝑡,𝑢,̇𝑢)𝑑𝑡0.(12) Clearly the class of (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-quasi-type-I functions and the class of (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I functions are more general than the class of (𝜌0,𝜌1)(𝜂,𝜃)𝐵-type-I functions.

Definition 8. A pair (𝑓,) is said to be 𝐵𝜌0(𝜂,𝜃)-quasi-𝜌1(𝜂,𝜃)-pseudo-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃 if there exist functions 𝑏0, 𝑏1𝐶(𝐼,𝑛)×𝐶(𝐼,𝑛)+ and 𝜂, 𝜃𝐼×𝑛×𝑛𝑛 with 𝜂(𝑡,𝑥,𝑥)=0, 𝜌0,𝜌1 such that for all 𝑥𝐾𝑏0(𝑥,𝑢)𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡0𝑏𝑎𝜂(𝑡,𝑥,𝑢)T𝑓𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝜌0𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0,(13)𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0𝑏1(𝑥,𝑢)𝑏𝑎(𝑡,𝑢,̇𝑢)𝑑𝑡0.(14) If, in the above definition, inequality (14) is satisfied as 𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0𝑏1(𝑥,𝑢)𝑏𝑎(𝑡,𝑢,̇𝑢)𝑑𝑡>0,(15) then we say that a pair (𝑓,) is 𝐵𝜌0(𝜂,𝜃)-quasi-𝜌1(𝜂,𝜃)-strictly pseudo-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃 and 𝜌0,𝜌1.

Definition 9. A pair (𝑓,) is said to be 𝐵𝜌0(𝜂,𝜃)-strongly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, 𝜃 if there exist functions 𝑏0, 𝑏1𝐶(𝐼,𝑛)×𝐶(𝐼,𝑛)+ and 𝜂, 𝜃𝐼×𝑛×𝑛𝑛 with 𝜂(𝑡,𝑥,𝑥)=0, 𝜌0,𝜌1 such that for all 𝑥𝐾𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑓𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝜌0𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0𝑏0(𝑥,𝑢)𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡0,(16)𝑏1(𝑥,𝑢)𝑏𝑎(𝑡,𝑢,̇𝑢)𝑑𝑡0𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑥(𝑑𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0.(17) If, in the above definition, inequality (16) is satisfied as 𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑓𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝜌0𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0𝑏0(𝑥,𝑢)𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡>0(18) then we say that a pair (𝑓,) is 𝐵𝜌0(𝜂,𝜃)-strictly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑢𝐶(𝐼,𝑛) with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃 and 𝜌0,𝜌1.

Remark 10. Let 𝜓𝐼×𝑛×𝑛 be a continuously differentiable function with respect to each of the arguments. Let 𝑥,𝑢𝐼𝑛 be differentiable with 𝑥(𝑎)=𝑢(𝑎)=𝛼 and 𝑥(𝑏)=𝑢(𝑏)=𝛽. Then, 𝑏𝑎𝑑𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝜓̇𝑥(𝑡,𝑢,̇𝑢)𝑑𝑡=𝑏𝑎𝑑𝜂(𝑡,𝑥,𝑢)𝜓𝑑𝑡̇𝑥(𝑡,𝑢,̇𝑢)𝑑𝑡.(19)

Lemma 11. Every (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I function is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I function but the converse is not true.

Proof. It is clear that the statement every (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I function is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I function but the converse is not true follows from the following counter example. Example 12. Let 𝑓𝐼×[0,1]×[0,1] be defined by 𝑓(𝑡,𝑥(𝑡),̇𝑥(𝑡))=𝑥3(𝑡)𝑥(𝑡).(20) Let 𝐼×[0,1]×[0,1] be defined by (𝑡,𝑥(𝑡),̇𝑥(𝑡))=3𝑥2(𝑡)+𝑥(𝑡)4.(21) Let the functions 𝜂𝐼×[0,1]×[0,1] and 𝜃𝐼×[0,1]×[0,1] be defined by 𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))=𝑥(𝑡)𝑢(𝑡)5if0𝑢(𝑡)<𝑥(𝑡),if𝑢(𝑡)𝑥(t),𝜃(𝑡,𝑥(𝑡),𝑢(𝑡))=𝑥(𝑡)𝑢(𝑡)5if0𝑢(𝑡)<𝑥(𝑡),if𝑢(𝑡)𝑥(𝑡).(22) Let the functions 𝑏0[0,1]×[0,1]+ and 𝑏1[0,1]×[0,1]+ be defined by 𝑏0(𝑥(𝑡),𝑢(𝑡))=𝑥(𝑡)+𝑢(𝑡)+2=𝑏1(𝑥(𝑡),𝑢(𝑡)).(23) Taking 𝜌0=1 and 𝜌1=1, we have to show that the pair (𝑓,) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I but not (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I with respect to 𝑏0, 𝑏1, 𝜂, and 𝜃. First we verify that (𝑓,) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I function. Case 1. When 𝑢(𝑡)<𝑥(𝑡), it follows that 𝑏0(𝑥(𝑡),𝑢(𝑡))𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡=(𝑥(𝑡)+𝑢(𝑡)+2)𝑏𝑎𝑥3(𝑡)𝑥(𝑡)+𝑢3(𝑡)+𝑢(𝑡)𝑑𝑡=(𝑥(𝑡)+𝑢(𝑡)+2)𝑏𝑎𝑢3(𝑡)𝑥3×(𝑡)+(𝑢(𝑡)𝑥(𝑡))𝑑𝑡=(𝑥(𝑡)+𝑢(𝑡)+2)𝑏𝑎𝑢(𝑢(𝑡)𝑥(𝑡))×2(𝑡)+𝑥2(𝑡)+𝑢(t)𝑥(𝑡)+1𝑑𝑡<0(since[])𝑥(𝑡),𝑢(𝑡)0,1𝑏𝑎𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇𝑓𝑥(𝑑𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝑑𝑡𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇×𝑓̇𝑥(𝑡,𝑢(𝑡),̇𝑢(𝑡)+𝜌0𝜃(𝑡,𝑥(𝑡),𝑢(𝑡))2=𝑑𝑡𝑏𝑎𝑥(𝑡)𝑢(𝑡)53𝑢2(𝑡)1𝑥(𝑡)𝑢(𝑡)5=𝑑𝑡𝑏𝑎𝑥(𝑡)𝑢(𝑡)53𝑢2(𝑡)2𝑑𝑡<0.(24) Again 𝑏𝑎𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇𝑥𝑑(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝑑𝑡𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇̇𝑥×(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝜌1𝜃(𝑡,𝑥(𝑡),𝑢(𝑡))2=𝑑𝑡𝑏𝑎𝑥(𝑡)𝑢(𝑡)5(6𝑢(𝑡)+1)𝑥(𝑡)𝑢(𝑡)5=𝑑𝑡𝑏𝑎𝑥(𝑡)𝑢(𝑡)56𝑢(𝑡)𝑑𝑡0𝑏1(𝑥(𝑡),𝑢(𝑡))𝑏𝑎(𝑡,𝑢(𝑡),̇𝑢(𝑡))𝑑𝑡=(𝑥(𝑡)+𝑢(𝑡)+2)𝑏𝑎3𝑢2(𝑡)+𝑢(𝑡)4𝑑𝑡0.(25)Case 2. When 𝑢(𝑡)𝑥(𝑡), it is clear that 𝑏𝑎𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇𝑓𝑥𝑑(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝑑𝑡𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇×𝑓̇𝑥(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝜌0𝜃(𝑡,𝑥(𝑡),𝑢(𝑡))2𝑑𝑡0𝑏0(×𝑥(𝑡),𝑢(𝑡))𝑏𝑎𝑓(𝑡,𝑥(𝑡),̇𝑥(𝑡))𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢(𝑡),̇𝑢(𝑡))𝑑𝑡0,𝑏𝑎𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇𝑥𝑑(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝑑𝑡𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇×̇𝑥(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝜌1(𝜃𝑡,𝑥(𝑡),𝑢(𝑡))2𝑑𝑡0𝑏1(𝑥(𝑡),𝑢(𝑡))𝑏𝑎(𝑡,𝑢(𝑡),̇𝑢(𝑡))𝑑𝑡0.(26) From Cases 1 and 2, it is clear that the pair (𝑓,) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-strongly pseudo-type-I.
But the pair (𝑓,) is not (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I for 𝑢(𝑡)<𝑥(𝑡) because𝑏0(𝑥(𝑡),𝑢(𝑡))𝑏𝑎𝑓(𝑡,𝑥(𝑡),̇𝑥(𝑡))𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢(𝑡),̇𝑢(𝑡))𝑑𝑡𝑏𝑎𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇𝑓𝑥𝑑(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝑑𝑡𝜂(𝑡,𝑥(𝑡),𝑢(𝑡))𝑇×𝑓̇𝑥(𝑡,𝑢(𝑡),̇𝑢(𝑡))+𝜌0𝜃(𝑡,𝑥(𝑡),𝑢(𝑡))2𝑑𝑡=(𝑥(𝑡)+𝑢(𝑡)+2)𝑏𝑎𝑢3(𝑡)𝑥3(𝑡)+(𝑢(𝑡)𝑥(𝑡))𝑥(𝑡)𝑢(𝑡)53𝑢2×(𝑡)2𝑑𝑡=(𝑥(𝑡)+𝑢(𝑡)+2)𝑏𝑎𝑥(𝑡)𝑢(𝑡)5×𝑢(𝑢(𝑡)𝑥(𝑡))2(𝑡)+𝑥2+(𝑡)+𝑢(𝑡)𝑥(𝑡)+1𝑥(𝑡)𝑢(𝑡)53𝑢2(𝑡)+2𝑑𝑡<0.(27)

3. Optimality Conditions

Theorem 13 (necessary optimality conditions). Let 𝑥𝐾 be a properly efficient solution for (𝑉𝑃) which is assumed to be normal solution for (𝑃𝑘), for 𝑘=1,2,,𝑝. Then, there exist 𝜆𝑝 and a piecewise smooth function 𝑦𝐼𝑚 such that 𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥=𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥,𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥=0,𝑡𝐼,𝑦(𝑡)0,𝑡𝐼,𝜆0.(28)

Proof. See [5].

Theorem 14. Let 𝑥 be a feasible solution of (VP), and let there exist 𝜆𝑝, 𝜆>0, and a piecewise smooth function 𝑦𝐼𝑚 such that for all 𝑡𝐼𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥=𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥,(29)𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥=0,(30)𝑦(𝑡)0.(31) Further, if (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, 𝜃, 𝜌0,𝜌1, and 𝜌0+𝜌10, with 𝑏0(𝑥,𝑥)>0forall𝑥𝐾, then 𝑥 is a properly efficient solution of (𝑉𝑃).

Proof. As (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-type-I at 𝑥, for all 𝑥𝐾, we have 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡,(32)𝑏1𝑥,𝑥𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇×𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡.(33) Since 𝑦(𝑡)𝑇(𝑡,𝑥,̇𝑥)=0, we write (33) as 0𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇×𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡.(34) Adding (32) and (34), we have 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇×𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌0+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡.(35) Using Remark 10, (35) becomes 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌0+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡.(36) By (29) and 𝜌0+𝜌10, we have 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡0.(37) As 𝑏0(𝑥,𝑥)>0, it follows that 𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡0,(38) that is, 𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡,(39) which implies that 𝑥 minimizes 𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡 over 𝐾 with 𝜆>0. Hence 𝑥 is a properly efficient solution of (𝑉𝑃) on account of Theorem 1 of Bector and Husain [3].

Theorem 15. Let 𝑥 be a feasible solution of (𝑉𝑃), and let there exist 𝜆𝑝, 𝜆>0, and a piecewise smooth function 𝑦𝐼𝑚 such that, for every 𝑡𝐼, conditions, (29)–(31) of Theorem 14 are satisfied. Further, if (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-semistrictly-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, 𝜃, 𝜌0,𝜌1, and 𝜌0+𝜌10, with 𝑏0(𝑥,𝑥)>0  for all  𝑥𝐾, then 𝑥 is a properly efficient solution of (𝑉𝑃).

Proof. Let 𝑥 be not; an efficient solution of (𝑉𝑃), then there exist 𝑥𝐾 and an index 1𝑟𝑃 such that the following inequalities 𝑏𝑎𝑓𝑗(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓𝑗𝑡,𝑥,̇𝑥𝑑𝑡,𝑗𝑟,𝑗=1,2,𝑝,𝑏𝑎𝑓𝑟(𝑡,𝑥,̇𝑥)𝑑𝑡<𝑏𝑎𝑓𝑟𝑡,𝑥,̇𝑥𝑑𝑡(40) hold. Because 𝜆>0 and 𝑏0(𝑥,𝑥)>0, (40) imply 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡0.(41) Further in view of (30) 𝑏1𝑥,𝑥𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥𝑑𝑡=0.(42) As (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is (𝜌0,𝜌1)(𝜂,𝜃)-𝐵-semistrictly-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, and 𝜃, we have 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡<0,𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇×𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(43) Adding (43), we have 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌0+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡<0.(44) By Remark 10, we have 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌0+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡<0,(45) which contradicts (29) and 𝜌0+𝜌10. Hence 𝑥 is a properly efficient solution of (𝑉𝑃).

Theorem 16. Let 𝑥 be a feasible solution of (VP), and let there exist 𝜆𝑝, 𝜆>0, and a piecewise smooth function 𝑦𝐼𝑚 such that conditions (29) of Theorem 14 are satisfied by (𝑥,𝜆,𝑦). Further, if (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-strongly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, 𝜃, 𝜌0,𝜌1 and 𝜌0+𝜌10, 𝑏1(𝑥,𝑥)>0𝑓𝑜𝑟𝑎𝑙𝑙𝑥𝐾, then 𝑥 is a properly efficient solution of (VP).

Proof. From (30), we have 𝑏1𝑥,𝑥𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥=0.(46) As (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-strongly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, and 𝜃, 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇×̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(47) Using Remark 10, (45) becomes 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(48) Equation (48) along with (29) gives 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(49) Using Remark 10, for all 𝑥𝐾, (48) becomes 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0𝑥𝐾.(50) As 𝜌0+𝜌10, we have 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(51) Equation (51) along with the fact that (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-strongly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑥 gives 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥0.(52) Since 𝑏0(𝑥,𝑥)>0, it follows that 𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑥𝐾.(53) Hence 𝑥 minimizes 𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡 over 𝐾 with 𝜆>0.
Therefore 𝑥 is a properly efficient solution of (𝑉𝑃) ([3, Theorem 1]).

Theorem 17. Let 𝑥 be a feasible solution of (𝑉𝑃), and let there exist 𝜆𝑝, 𝜆>0, and a piecewise smooth function 𝑦𝐼𝑚 such that the conditions (29)–(31) of Theorem 14 are satisfied by (𝑥,𝜆,𝑦). Further, if (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-quasi-𝜌1(𝜂,𝜃)-strictly pseudo-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, 𝜃, 𝜌0,𝜌1, and 𝜌0+𝜌10, with 𝑏0(𝑥,𝑥)>0 for all 𝑥𝐾, then 𝑥 is a properly efficient solution of (𝑉𝑃).

Proof. If 𝑥 is not an efficient solution of (𝑉𝑃), then there exist 𝑥𝐾 and an index 𝑟, 1𝑟𝑝, such that 𝑏𝑎𝑓𝑗(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓𝑗𝑡,𝑥,̇𝑥𝑑𝑡𝑗𝑟,𝑗=1,2,𝑝,𝑏𝑎𝑓𝑟(𝑡,𝑥,̇𝑥)𝑑𝑡<𝑏𝑎𝑓𝑟𝑡,𝑥,̇𝑥𝑑𝑡.(54) Because 𝜆>0 and 𝑏0(𝑥,𝑥)>0, the previous relations give 𝑏0𝑥,𝑥𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡0,(55) which along with the fact that (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-quasi-𝜌1(𝜂,𝜃)-strictly pseudo-type-I at 𝑥 with respect to functions 𝑏0, 𝑏1, 𝜂, and 𝜃 gives 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(56) Using Remark 10, (56) becomes 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥𝜂𝑡,𝑥,𝑥𝑇𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(57) that is, 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝜆𝑇𝑓𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑥,̇𝑥+𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(58) Now using (29) in (58), we have 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇×𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥𝑑𝑡+𝜌0𝜃𝑡,𝑥,𝑥20.(59) It follows that 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇x𝜌0𝜃𝑡,𝑥,𝑥2𝑑𝑡0,𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥𝑑𝑡𝜌0𝜃𝑡,𝑥,𝑥2.(60) As 𝜌0+𝜌10, we have 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥𝑑𝑑𝑡𝑦(𝑡)𝑇̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0.(61) Again using Remark 10, we obtain 𝑏𝑎𝜂𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑥,̇𝑥+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑥𝑇𝑦(𝑡)𝑇×̇𝑥𝑡,𝑥,̇𝑥+𝜌1𝜃𝑡,𝑥,𝑥2𝑑𝑡0,(62) which in view of a given hypothesis implies that 𝑏1𝑥,𝑥𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥>0.(63) Since 𝑏1(𝑥,𝑥)>0, we obtain 𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑥,̇𝑥>0,(64) which contradicts (30). Hence 𝑥 is a properly efficient solution of (𝑉𝑃).

4. Duality

The Mond-Weir-type dual problem associated with (𝑉𝑃) is given by (𝑉𝐷)maximize𝑏𝑎=𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡𝑏𝑎𝑓1(𝑡,𝑢,̇𝑢)𝑑𝑡,,𝑏𝑎𝑓𝑝,(𝑡,𝑢,̇𝑢)𝑑𝑡subjectto𝑢(𝑎)=𝛼,𝑢(𝑏)=𝛽,(65)𝜆𝑇𝑓𝑥(𝑡,𝑢,̇𝑢)+𝑦(𝑡)𝑇𝑥=𝑑(𝑡,𝑢,̇𝑢)𝜆𝑑𝑡𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝑦(𝑡)𝑇̇𝑥,(𝑡,𝑢,̇𝑢)(66)𝑦(𝑡)𝑇(𝑡,𝑢,̇𝑢)0,𝑡𝐼,(67)𝑦(𝑡)0,𝑡𝐼,(68)𝜆𝑝,𝜆0,𝜆𝑇𝑒=1,𝑒=(1,1,,1)𝑝.(69) We now establish duality results between (𝑉𝑃) and (𝑉𝐷) under generalized 𝐵-type-I conditions.

Theorem 18 (weak duality). Let 𝑥 be a feasible solution of (𝑉𝑃), and let (𝑢,𝜆,𝑦) be a feasible solution of (VD ). Let either the following conditions hold. (i)(𝜆𝑇𝑓,𝑦(𝑡)𝑇) is (𝜌0,𝜌1)(𝜂,𝜃)𝐵-semi-strictly-type-I at 𝑢 with respect to functions 𝑏0, 𝑏1, 𝜂, 𝜃, 𝜌0,𝜌1 and 𝜌0+𝜌10.(ii)𝜆>0 and (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-strongly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑢 with respect to functions 𝑏0, 𝑏1, 𝜂, and 𝜃 with 𝑏1(𝑥,𝑢)>0, 𝜌0,𝜌1 and 𝜌0+𝜌10.(iii)(𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-quasi-𝜌1(𝜂,𝜃)-strictly pseudo-type-I at 𝑢 with respect to functions 𝑏0, 𝑏1, 𝜂, and 𝜃, with 𝑏0(𝑥,𝑢)>0, 𝜌0,𝜌1, and 𝜌0+𝜌10, Then 𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡.(70)

Proof. (i) Let, if possible, 𝑏𝑎𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡.(71) Then there exists an index 𝑟, 1𝑟𝑝, such that 𝑏𝑎𝑓𝑗(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓𝑗𝑡,𝑥,̇𝑥𝑑𝑡𝑗𝑟,𝑗=1,2,𝑝,𝑏𝑎𝑓𝑟(𝑡,𝑥,̇𝑥)𝑑𝑡<𝑏𝑎𝑓𝑟𝑡,𝑥,̇𝑥𝑑𝑡.(72) Because 𝜆>0 and 𝑏0(𝑥,𝑢)>0, the above relations give 𝑏0(𝑥,𝑢)𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏0(𝑥,𝑢)𝑏𝑎𝜆𝑇𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡,(73) that is, 𝑏0(𝑥,𝑢)𝑏𝑎𝜆𝑇𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝜆𝑇𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡0(74) which is the same as (41) with 𝑥 replaced by 𝑢 and 𝜆 replaced by 𝜆. The rest of the proof runs on the same line of that of Theorem 15 and hence is omitted.
(ii) From (67), we get𝑏𝑎𝑦(𝑡)𝑇(𝑡,𝑢,̇𝑢)0.(75) Since 𝑏1(𝑥,𝑢)>0, we have 𝑏1(𝑥,𝑢)𝑏𝑎𝑦(𝑡)𝑇(𝑡,𝑢,̇𝑢)0,(76) which implies that 𝑏𝑎𝜂(𝑡,𝑥,𝑢)𝑇𝑦(𝑡)𝑇𝑥𝑑(𝑡,𝑢,̇𝑢)+𝑑𝑡𝜂(𝑡,𝑥,𝑢)𝑇𝑦(𝑡)𝑇×̇𝑥(𝑡,𝑢,̇𝑢)+𝜌1𝜃(𝑡,𝑥,𝑢)2𝑑𝑡0,(77) on account of hypothesis (ii). This is the same as (45) with 𝑥 replaced by 𝑢 and 𝑦 replaced by 𝑦. Again proceeding on the lines of Theorem 16, we get the result.
(iii) Proof of this part follows on the lines of Theorem 17 and hence is omitted.

Theorem 19 (strong duality). Let 𝑥 be a properly efficient solution of (𝑉𝑃). Assume that 𝑥 is normal for each (𝑃𝑘), 𝑘=1,2,,𝑝. Then there exist 𝜆𝑝 and a piecewise smooth function 𝑦𝐼𝑚 such that (𝑥,𝜆,𝑦) is feasible for (𝑉𝐷). Further, if, for each feasible (𝑢,𝜆,𝑦) of (𝑉𝐷), any of the conditions of Theorem 18 hold, then (𝑥,𝜆,𝑦) is a properly efficient solution of (𝑉𝐷).

Proof. Because 𝑥 is a properly efficient solution of (𝑉𝑃), it follows that, from Theorem 13 there exist 𝜆𝑝 and a piecewise smooth function 𝑦𝐼𝑚 such that (28) hold. Moreover, 𝑥𝐾, and hence the feasibility of (𝑥,𝜆,𝑦) for (𝑉𝐷) follows. As the weak duality (Theorem 18) holds between (𝑉𝑃) and (𝑉𝐷), (𝑥,𝜆,𝑦) is an efficient solution of (𝑉𝐷). If (𝑥,𝜆,𝑦) is not a properly efficient solution of (𝑉𝐷), then, proceeding on the lines to that of [3, Theorem 1], we get a contradiction to the weak duality.

Theorem 20 (strict converse duality). Let 𝑥 be feasible for (𝑉𝑃), and let (𝑢,𝜆,𝑦) be feasible for (VD ) such that 𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡=𝑏𝑎𝜆𝑇𝑓𝑡,𝑢,̇𝑢𝑑𝑡.(78) Further, let (𝜆𝑇𝑓,𝑦(𝑡)𝑇) be 𝐵𝜌0(𝜂,𝜃)-strictly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑢 with respect to functions 𝑏0, 𝑏1, 𝜂, 𝜃, 𝜌0,𝜌1, and 𝜌0+𝜌10, 𝑏0(𝑥,𝑢)>0, 𝑏1(𝑥,𝑢)>0 for all 𝑥𝐾. Then 𝑥 is a properly efficient solution of (𝑉𝑃).

Proof. We assume that 𝑥𝑢 and get a contradiction. Feasibility of (𝑢,𝜆,𝑦) for (𝑉𝐷) implies that 𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑢,̇𝑢𝑑𝑡0.(79) As 𝑏1(𝑥,𝑢)>0, we have 𝑏1𝑥,𝑢𝑏𝑎𝑦(𝑡)𝑇𝑡,𝑢,̇𝑢𝑑𝑡0.(80) Equation (80) along with the fact that (𝜆𝑇𝑓,𝑦(𝑡)𝑇) is 𝐵𝜌0(𝜂,𝜃)-strictly pseudo-𝜌1(𝜂,𝜃)-quasi-type-I at 𝑢 implies that 𝑏𝑎𝜂𝑡,𝑥,𝑢𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑢,̇𝑢+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑢𝑇𝑦(𝑡)𝑇̇𝑥𝑡,𝑢,̇𝑢+𝜌1𝜃𝑡,𝑥,𝑢2𝑑𝑡0.(81) Using Remark 10 (with 𝜓 replaced by 𝑦(𝑡)𝑇) in (81), we get 𝑏𝑎𝜂𝑡,𝑥,𝑢𝑇𝑦(𝑡)𝑇𝑥𝑡,𝑢,̇𝑢𝑑𝑑𝑡𝑦(𝑡)𝑇̇𝑥𝑡,𝑢,̇𝑢+𝜌1𝜃𝑡,𝑥,𝑢20.(82) Equation (82) along with (66) gives 𝑏𝑎𝜂𝑡,𝑥,𝑢𝑇𝜆𝑇𝑓𝑥𝑡,𝑢,̇𝑢𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑢,̇𝑢𝜌1𝜃𝑡,𝑥,𝑢20.(83) Since 𝜌0+𝜌10, we have 𝑏𝑎𝜂𝑡,𝑥,𝑢𝑇𝜆𝑇𝑓𝑥𝑡,𝑢,̇𝑢𝑑𝑑𝑡𝜆𝑇𝑓̇𝑥𝑡,𝑢,̇𝑢+𝜌0𝜃𝑡,𝑥,𝑢2𝑑𝑡0.(84) Again using Remark 10 (with 𝜓 replaced by 𝜆𝑇𝑓) in (84), we obtain 𝑏𝑎𝜂𝑡,𝑥,𝑢𝑇𝜆𝑇𝑓𝑥𝑡,𝑢,̇𝑢+𝑑𝜂𝑑𝑡𝑡,𝑥,𝑢𝑇𝜆𝑇𝑓̇𝑥𝑡,𝑢,̇𝑢𝑑𝑡+𝜌0𝜃𝑡,𝑥,𝑢20,(85) which in view of the given hypothesis implies that 𝑏0𝑥,𝑢𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡𝑏𝑎𝜆𝑇𝑓𝑡,𝑢,̇𝑢𝑑𝑡>0.(86) As 𝑏0(𝑥,𝑢)>0, it follows that 𝑏𝑎𝜆𝑇𝑓𝑡,𝑥,̇𝑥𝑑𝑡>𝑏𝑎𝜆𝑇𝑓𝑡,𝑢,̇𝑢.(87) But this contradicts (78), hence the result.

All the optimality conditions and duality results developed for (𝑉𝑃) in the previous sections can easily be modified for several other classes of variational problems.

5.1. Natural Boundary Value Problems

Omitting the boundary conditions for the fixed end points as was done by Mond and Hanson [2], we obtain𝑉𝑃0minimize𝑏𝑎=𝑓(𝑡,𝑥,̇𝑥)𝑑𝑡𝑏𝑎𝑓1(𝑡,𝑥,̇𝑥)𝑑𝑡,,𝑏𝑎𝑓𝑝(𝑡,𝑥,̇𝑥)𝑑𝑡subjectto(𝑡,𝑥,̇𝑥)0𝑡𝐼.(88) The corresponding Mond-Weir type dual is given by 𝑉𝐷0maximize𝑏𝑎=𝑓(𝑡,𝑢,̇𝑢)𝑑𝑡𝑏𝑎𝑓1(𝑡,𝑢,̇𝑢)𝑑𝑡,,𝑏𝑎𝑓𝑝(𝑡,𝑢,̇𝑢)𝑑𝑡subjectto𝜆T𝑓𝑥(𝑡,𝑢,̇𝑢)+𝑦(𝑡)𝑇𝑥(=𝑑𝑡,𝑢,̇𝑢)𝜆𝑑𝑡𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)+𝑦(𝑡)𝑇̇𝑥,(𝑡,𝑢,̇𝑢)𝑦(𝑡)0,𝑡𝐼,𝑦(𝑡)𝑇𝑥(𝑡,𝑢,̇𝑢)𝑡=𝑎=0,𝑦(𝑡)𝑇̇𝑥(𝑡,𝑢,̇𝑢)𝑡=𝑏𝜆=0,𝑇𝑓𝑥(𝑡,𝑢,̇𝑢)𝑡=𝑎𝜆=0,𝑇𝑓̇𝑥(𝑡,𝑢,̇𝑢)𝑡=𝑏=0,𝜆0,𝜆𝑇𝑒=1,𝑒=(1,1,,1)𝑝.(89) If the problems (𝑉𝑃0) and (𝑉𝐷0) are independent of 𝑡, then these problems essentially reduce to the static case (𝑉𝑃) and (𝑉𝐷) of multiobjective nonlinear programs: 𝑉𝑃minimize𝑓𝑓(𝑥)=1(𝑥),𝑓2(𝑥),,𝑓𝑝(𝑥)subjectto𝑉(𝑥)0,𝐷maximize𝑓𝑓(𝑢)=1(𝑢),𝑓2(𝑢),,𝑓𝑝,(𝑢)subjectto𝜆𝑇𝑓𝑥+𝑦(𝑡)𝑇𝑥=0,𝑦0,𝜆0,𝜆𝑇𝑒=1,𝑒=(1,1,,1)𝑝.(90)

Acknowledgments

The authors wish to thank the referees and the Editor for their valuable suggestions which improved the presentation of the paper.