Theory and MethodologySymmetric duality with pseudo-invexity in variational problems
Introduction
Duality in nonlinear programming is usually treated using the scheme of Wolfe [11], in which the formation of a dual involves the introduction of new variables corresponding to primal constraints. Thus, except in linear programs, the primal can not be obtained by forming the dual of the dual.
The concept of symmetric dual programs, in which the dual of the dual equals the primal, was introduced and developed in Refs. 3, 2. Mond and Hanson [5] extended symmetric duality to variational problems, giving continuous analogues of the previous results.
Assumptions common to these works are those of convexity and concavity. Since the identification of invex functions in Ref. [4], pseudo-invex functions in Refs. 6, 8, 9, many results which formerly required concavity have been extended using invexity and pseudo-invexity, including the variational problems in Ref. [7] and in Refs. 6, 8, 9, respectively. In this paper, we apply pseudo-invexity to symmetric dual variational problems of Smart and Mond [10]. The special case of self-dual variational problems, along with the reduction to static symmetric dual programs when there is no time dependency is presented.
Section snippets
Notation
Consider the real scalar function f(t,x,x′,y,y′), where t∈[to,tf], x and y are functions of t with x(t)∈Rn and y(t)∈Rm, and x′ and y′ denote the derivatives of x and y, respectively, with respect to t. Assume that f has continuous fourth-order partial derivatives w.r.t. and fx′ denote the gradient vectors of f w.r.t. x and x′ i.e.where T denotes transpose of a matrix. Similarly, fy and fy′ denote the gradient vectors of f w.r.t. y and y′.
The
Symmetric duality
Let S be a nonempty subset of a normed linear space X, the positive dual cone of S (denoted by ) is defined bywhere denotes the space of all continuous linear functionals on X, and .
Let S1, S2 be closed convex cones with nonempty interiors in Rn and Rm, respectively.
We consider the problem of finding functions x:[to,tf]→Rn and , with piecewise smooth on [to,tf], to solve the following pair of optimization problems:
(P) Minimize
Self-duality
Assume m=n,f(t,x,x′,y,y′)=−f(t,y,y′,x,x′) i.e. (f is skew-symmetric) and that . It follows that (D) may be rewritten as a minimization problem:
(D′) Maximizesubject to:which becomes
(D′) Minimisesubject to:(D′) is formally identical
Static symmetric dual programs
If the time dependency of problems (P) and (D) is removed and f is considered to have domain Rn×Rm, we obtain the symmetric dual pair given by
(SP) Minimizesubject to:(SD) Maximizesubject to:
Definition. The function f:Rn×Rm→R is pseudo-invex w.r.t. η:Rn×Rn→Rn if for each y∈Rm, η:Rn×Rn→Rn such that−f is pseudo-invex w.r.t. ξ in y if for each ξ:Rm×Rm→Rm such thatNote
Acknowledgements
The authors thank the referees for their valuable suggestions which improved the presentation of the paper.
References (11)
On sufficiency of the Kuhn–Tucker conditions
Journal of Mathematical Analysis and Applications
(1981)- et al.
Symmetric duality for variational problems
Journal of Mathematical Analysis and Applications
(1968) - et al.
Duality for variational problems with invexity
Journal of Mathematical Analysis and Applications
(1988) - et al.
Duality and sufficiency in control problems with invexity
Journal of Mathematical Analysis and Applications
(1988) - et al.
Symmetric duality with invexity in variational problems
Journal of Mathematical Analysis and Applications
(1990)
Cited by (10)
Symmetric duality with (p, r) - ρ - (η, θ)-invexity
2011, Applied Mathematics and ComputationCitation Excerpt :Later Nahak [13] established generalized symmetric dual programs with ρ − (η, θ)-invexity. Nahak and Nanda [14] also applied the symmetric duality concept for this type of programming under pseudoinvexity assumptions. Later, Lee and Kim [9] established symmetric duality relations for multiobjective variational problems under invexity assumptions by using concept of efficiency with nonnegativity orthant as the cone.
Weakly efficient solutions and pseudoinvexity in multiobjective control problems
2010, Nonlinear Analysis, Theory, Methods and ApplicationsEfficient solutions in V-KT-pseudoinvex multiobjective control problems: A characterization
2009, Applied Mathematics and ComputationKT-invex control problem
2008, Applied Mathematics and ComputationOn variational problems: Characterization of solutions and duality
2005, Journal of Mathematical Analysis and ApplicationsNew-invexity type conditions with applications to constrained dynamic games
2003, European Journal of Operational Research