� � “main” — 2016/4/16 — 14:54 — page 81 — #1 � � � � � � Tema Tendências em Matemática Aplicada e Computacional, 17, N. 1 (2016), 81-92 © 2016 Sociedade Brasileira de Matemática Aplicada e Computacional www.scielo.br/tema doi: 10.5540/tema.2016.017.01.0081 Existence of Solutions for Optimal Control Problems on Time Scales whose States are Absolutely Continuous I.L.D. SANTOS Received on June 21, 2015 / Accepted on February 17, 2016 ABSTRACT. This paper considers a class of optimal control problems on time scales described by dynamic equations on time scales. For this class, the states are absolutely continuous. We have established sufficient conditions for the existence of optimal controls. Keywords: Time scales, control systems, optimal control. 1 INTRODUCTION The existence of solutions to optimal control problems on time scales can be found in [7, 11, 13]. In this report, we have studied control systems covered in [6] to the study of necessary optimal- ity conditions. However, unlike [6] here the states are absolutely continuous functions and the controls are �-measurable functions. To the class of control systems studied here, we establish an extension of Filippov’s selection theorem [4]. Using standards arguments to the obtaining of optimal controls, see for instance [4, 8, 12], we get the existence of solutions to optimal control problems on time scales. The result of existence obtained here relies on [[11], Theorem 5.2], the difference is in the classes of control systems studied. The paper is organized as follows. In Section 2, we provided basic concepts and results on time scales theory. Section 3 presents the result of existence of optimal processes to optimal control problems on time scales. 2 PRELIMINARIES 2.1 Time scales A time scale is a nonempty closed subset of real numbers. Here we use a bounded time scale T, where a = minT and b = maxT are such that a < b. Departamento de Matemática – FEIS, UNESP – Universidade Estadual Paulista, 15385-000 Ilha Solteira, SP, Brasil. E-mail: iguerluis@mat.feis.unesp.br � � “main” — 2016/4/16 — 14:54 — page 82 — #2 � � � � � � 82 EXISTENCE OF SOLUTIONS FOR OPTIMAL CONTROL PROBLEMS Define the forward jump operator σ : T → T by σ(t) = inf{s ∈ T : s > t} and the backward jump operator ρ : T → T by ρ(t) = sup{s ∈ T : s < t}. We assume that inf ∅ = supT and sup ∅ = infT. Let μ : T → [0, +∞) be defined as μ(t) = σ(t) − t . Lemma 2.1 ([3]). There exist I ⊂ N and {ti}i∈I ⊂ T such that RS := {t ∈ T : t < σ(t)} = {ti}i∈I , where RS stands for right scattered points of the time scale T. If A ⊂ R, define the set AT as AT = A ∩ T. We set Tκ = T \ (ρ(supT), supT]T. Take a function f : T → R and t ∈ Tκ . If ξ ∈ R is such that, for all ε > 0 there exists δ > 0 satisfying | f (σ(t)) − f (s) − ξ(σ(t) − s)| ≤ ε|σ(t) − s| for all s ∈ (t − δ, t + δ)T, we say that ξ is the delta derivative of f at t and we denote it by ξ := f �(t). Now, consider a function f : T → R n and t ∈ Tκ . We say that f is �-differentiable at t if each component fi : T → R of f is �-differentiable at t . In this case f �(t) = ( f � 1 (t), . . . , f � n (t)). The next result is an easy consequence of [[1], Theorem 1.16]. Theorem 2.1 ([1]). Consider a function f : T → R n and t ∈ Tκ . Then the following statements hold: (i) If f is �-differentiable at t then f is continuous at t . (ii) If f is continuous at t and σ(t) > t , then f is �-differentiable at t . Furthermore, f �(t) = f (σ(t)) − f (t) μ(t) . (iii) If σ(t) = t , then f is �-differentiable at t if and only if the following limit exists lim s T−→ t f (t) − f (s) t − s as an element of Rn. In this case f �(t) = lim s T−→ t f (t) − f (s) t − s . Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 83 — #3 � � � � � � SANTOS 83 (iv) If f is �-differentiable at t , then f (σ(t)) = f (t) + μ(t) f �(t). 2.2 �-measurable functions and �-integrability We denote the family of �-measurable sets of T by �. We recall that � is a σ -algebra of T. Given a function f : T → R n we define f̃ : [a, b] → R n as f̃ (t) = { f (t), t ∈ T f (ti), t ∈ (ti , σ(ti )) for some i ∈ I where I ⊂ N and {ti}i∈I ⊂ T are such that {t ∈ T : t < σ(t)} = {ti }i∈I . Proposition 2.1 given below can be easily obtained from [[3], Proposition 4.1]. Proposition 2.1 ([3]). Consider a function f : T → R n. Then f is �-measurable if and only if f̃ is Lebesgue measurable. Take a function f : T → R̄ and E ∈ �. We indicate by∫ E f (s)�s the Lebesgue �-integral of f over E . We denote the set of functions f : T → R which are Lebesgue �-integrable over E by L1(E). If f : T → R n is �-measurable and E ∈ �, we indicate by L1(E,Rn) the set of functions f : T → R n which are Lebesgue �-integrable over E . More in the subject on Lebesgue integration on time scales, can be found in [3, 5, 10]. Proposition 2.2 ([10]). Let f : T → [0, +∞) be a function in L1([a, b)T). Given ε > 0 there exists δ > 0 such that, if A ∈ � and μ�(A) < δ then∫ A f (s)�s < ε. Proposition 2.3 ([10]). Let g ∈ L1([a, b)T). Suppose that∫ [c,d)T g(s)�s ≥ 0 for each c, d ∈ T such that c < d. Then g(t) ≥ 0 �-a.e. t ∈ [a, b)T. 2.3 Absolutely continuous functions on time scales A function f : T → R n is absolutely continuous if given ε > 0 there exists δ > 0 such that N∑ i=1 ‖ f (bi ) − f (ai )‖ < ε Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 84 — #4 � � � � � � 84 EXISTENCE OF SOLUTIONS FOR OPTIMAL CONTROL PROBLEMS whenever ai ≤ bi and {[ai , bi)T}N i=1 are disjoint intervals satisfying N∑ i=1 (bi − ai ) < δ. The next theorem is an immediate consequence of [[2], Theorem 4.1]. Theorem 2.2. A function f : T → R n is absolutely continuous if and only if the following assertions are valid: 1. f is �-differentiable �-a.e. on [a, b)T and f � ∈ L1([a, b)T,Rn); 2. for each t ∈ T we have f (t) = f (a) + ∫ [a,t)T f �(s)�s. A function f : T → R n is said to be an arc if it is absolutely continuous. We denote the set of all arcs with domain T and taking values on Rn by AC(T,Rn ). Proposition 2.4 ([10]). Consider the sequence xi : T → R n of arcs and a function φ : T → [0, +∞) in L1([a, b)T). Suppose that for each i, we have ‖x� i (s)‖ ≤ φ(s) � − a.e. s ∈ [a, b)T. If {xi (a)} is a bounded sequence, then there exists a subsequence {xik } ⊂ {xi} and an arc x : T → R n such that xik ⇒ x. Furthermore, if c, d ∈ T and c < d then∫ [c,d)T x� ik (s)�s → ∫ [c,d)T x�(s)�s. Proposition 2.5 ([10]). Let x : T → R n be an arc and let k : T → [0, +∞) be a function in L1([a, b)T). Suppose ‖x�(t)‖ ≤ γ1‖x(t)‖ + k(t) � − a.e. t ∈ [a, b)T with γ1 ≥ 0. Then a) ‖x(t) − x(a)‖ ≤ γ1‖x(a)‖ ∫ [a,t)T eγ1(t−s)�s + ∫ [a,t)T k(s)eγ1 (t−s)�s; and b) ‖x(t)‖ ≤ ( γ1eγ1(b−a)(b − a) + 1 )‖x(a)‖ + eγ1(b−a) ∫ [a,b)T k(s)�s for all t ∈ T. Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 85 — #5 � � � � � � SANTOS 85 2.4 Set-valued functions properties Here we consider basic results of measurable set-valued functions. Let (�,F) be a measurable space. A set-valued function E : �� R n is said to beF-measurable if the set E−1(V ) = {x ∈ � : E(x) ∩ V �= ∅} is F-measurable for all compact sets V ⊂ R n . A set-valued function E is said to be closed, compact, convex or nonempty when its image E(x) obeys the required property, each point x ∈ �. Definition 2.1. Take U : T� R m. We define the set-valued function Ũ : [a, b]� R m by Ũ (t) = { U (t), t ∈ T U (ti ), t ∈ (ti , σ(ti )) for some i ∈ I. Lemma 2.2 ([11]). Let U : T� R m be a �-measurable set-valued function. Then the set-valued function Ũ : [a, b]� R m is Lebesgue measurable. Similarly to [[12],Theorem 2.3.14], we have the proposition below. Proposition 2.6. Consider a function g : [a, b] × R m → R and a closed nonempty set-valued function � : [a, b]� R m. Assume that (a) g is a Carathéodory function; (b) � is a Lebesgue measurable set-valued function. Let η : [a, b] → R̄ be defined by η(t) = sup u∈�(t) g(t, u). Then η is a Lebesgue measurable function. Using Proposition 2.1 and Lemma 2.2, we get the following consequence of the Proposition 2.6. Lemma 2.3. Consider a function g : T× R m → R and a closed nonempty set-valued function U : T� R m. Assume that (a) g is �-measurable at t , for each fixed (x, u), and continuous at (x, u), for each fixed t ; (b) U is a �-measurable set-valued function. Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 86 — #6 � � � � � � 86 EXISTENCE OF SOLUTIONS FOR OPTIMAL CONTROL PROBLEMS Then the function η : T → R̄ given by η(t) = sup u∈U(t) g(t, u) is a �-measurable function. Take a function f : T× R n × Rm → R n and a set-valued function U : T� R m . Consider the following hypotheses: (H1) f is continuous at (x, u), for each fixed t , and �-measurable at t , for each fixed (x, u). (H2) U is a compact, nonempty and �-measurable set-valued function. We define the function H : T× Rn × Rn → R as H (t, x, p) = max u∈U(t) 〈p , f (t, x, u)〉. If x : T → R n is a �-measurable function and p ∈ Rn , it is a consequence of Lemma 2.3 that t �→ H (t, x(t), p) is a �-measurable function. 2.5 Filippov’s selection theorem Consider the control system of equations{ x�(t) = f (t, x(σ(t)), u(t)) � − a.e. t ∈ [a, b)T u(t) ∈ U (t) � − a.e. t ∈ [a, b)T. (2.1) If the control process pair (x, u) obeys (2.1) then x obeys the following dynamical inclusion x�(t) ∈ { f (t, x(σ(t)), u) : u ∈ U (t)} � − a.e. t ∈ [a, b)T. (2.2) Similar to [[11],Theorem 4.8] we have the following extension of Filippov’s selection theorem. Theorem 2.3. Consider a function f : T×Rn × Rm → R n and a set-valued function U : T� R m. Assume that the function f and the set-valued function U satisfy the hypothesis (H1) and (H2). If x ∈ AC(T,Rn ) obeys (2.2) then there is a �-measurable selection u of U such that the process (x, u) obeys (2.1). Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 87 — #7 � � � � � � SANTOS 87 3 OPTIMAL CONTROL PROBLEMS IN TIME SCALES Here we get the existence of optimal controls to optimal control problems on time scales. Consider the optimal control problem on time scales (P) ⎧⎪⎪⎪⎨ ⎪⎪⎪⎩ min g(x(a), x(b)) over (x, u) obeying x�(t) = f (t, x(σ(t)), u(t)) � − a.e. t ∈ [a, b)T u(t) ∈ U (t) � − a.e. t ∈ [a, b)T (x(a), x(b)) ∈ A × C where A, C ⊂ R n , x ∈ AC(T,Rn ), u : T → R m is a �-measurable function, g : Rn ×Rn → R, f : T× Rn × Rm → R n and U : T� R m is a set-valued function. Consider the following hypotheses: (H3) A is a compact set and C is a closed set. (H4) g is a lower semicontinuous function. (H5) There exists K > 0 such that for any t ∈ T, one has ‖ f (t, x, u) − f (t, y, u)‖ ≤ K‖x − y‖ for any u ∈ U (t), and any x, y ∈ Rn . (H6) There are positive constant γ > 0 and a function c : T → [0, ∞) in L1([a, b)T) such that ‖ f (t, x, u)‖ ≤ γ ‖x‖ + c(t) � − a.e. t ∈ [a, b)T for all x ∈ Rn and all u ∈ U (t). (H7) The set f (t, x, U (t)) is convex for each t ∈ T and x ∈ Rn . (H8) Let j > 0. Suppose that γ μ(t) < 1 ∀t ∈ T and 1 1 − γ μ(t) ≤ j ∀t ∈ T. Let u : T → R m be a �-measurable function and x ∈ AC(T,Rn ). We say that (x, u) is an ad- missible process for (P), if the pair (x, u) satisfies (2.1) and x obeys the condition (x(a), x(b)) ∈ A × C. A process (x̄ , ū) is called an optimal process for (P), if it is an admissible process for (P) that satisfies g(x̄(a), x̄(b)) ≤ g(x(a), x(b)) Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 88 — #8 � � � � � � 88 EXISTENCE OF SOLUTIONS FOR OPTIMAL CONTROL PROBLEMS for all admissible process (x, u) of (P). Theorem 3.4 ensures the existence of optimal processes for (P). We get the Theorem 3.4 using the next two lemmas. Lemma 3.4. Assume (H8). Let f : T × R n × R m → R n be a function obeying (H6). If (x, u) satisfies (2.1) then ‖x�(t)‖ ≤ γ 1 − γ μ(t) ‖x(t)‖ + ( 1 + γ μ(t) 1 − γ μ(t) ) c(t) � − a.e. t ∈ [a, b)T. Proof. Let t ∈ [a, b)T be such that x�(t) = f (t, x(σ(t)), u(t)). If σ(t) = t we have ∥∥∥∥x�(t) ∥∥∥∥ = ∥∥∥∥ f (t, x(t), u(t)) ∥∥∥∥ ≤ γ ∥∥∥∥x(t) ∥∥∥∥ + c(t) ≤ γ 1 − γ μ(t) ∥∥∥∥x(t) ∥∥∥∥ + ( 1 + γ μ(t) 1 − γ μ(t) ) c(t) and if σ(t) > t we get∥∥∥∥x�(t) ∥∥∥∥ = ∥∥∥∥ f (t, x(σ(t)), u(t)) ∥∥∥∥ ≤ γ ∥∥∥∥x(σ(t)) ∥∥∥∥ + c(t) ≤ γ 1 − γ μ(t) ∥∥∥∥x(t) ∥∥∥∥ + ( 1 + γ μ(t) 1 − γ μ(t) ) c(t) since ∥∥∥∥x�(t) ∥∥∥∥ = ∥∥∥∥ x(σ(t)) − x(t) μ(t) ∥∥∥∥ = ∥∥∥∥ f (t, x(σ(t)), u(t)) ∥∥∥∥ ≤ γ ∥∥∥∥x(σ(t)) ∥∥∥∥ + c(t) and ∥∥∥∥x(σ(t)) ∥∥∥∥ − ∥∥∥∥x(t) ∥∥∥∥ μ(t) ≤ ∥∥∥∥ x(σ(t)) − x(t) μ(t) ∥∥∥∥ and then ∥∥∥∥x(σ(t)) ∥∥∥∥ ≤ 1 1 − γ μ(t) ∥∥∥∥x(t) ∥∥∥∥ + μ(t)c(t) 1 − γ μ(t) . Therefore∥∥∥∥x�(t) ∥∥∥∥ ≤ γ 1 − γ μ(t) ∥∥∥∥x(t) ∥∥∥∥ + ( 1 + γ μ(t) 1 − γ μ(t) ) c(t) � − a.e. t ∈ [a, b)T. � Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 89 — #9 � � � � � � SANTOS 89 Lemma 3.5. Assume (H8) and consider a function f : T × R n × R m → R n obeying (H6). Take a sequence (xi , ui) satisfying (2.1). If {xi(a)} is a bounded sequence, then there exists a subsequence {xik } ⊂ {xi } and an arc x : T → R n such that xik ⇒ x. Proof. Since 1 ≤ 1 1 − γ μ(t) ≤ j ∀t ∈ T it follows from Lemma 3.4 that∥∥∥∥x� i (t) ∥∥∥∥ ≤ jγ ∥∥∥∥xi(t) ∥∥∥∥ + ( 1 + γ (b − a) j ) c(t) � − a.e. t ∈ [a, b)T. Let γ1 := jγ and let k(t) := (1 + γ (b − a) j )c(t). Consider a real number L > 0 obeying∥∥∥∥xi(a) ∥∥∥∥ ≤ L ∀i. From Proposition 2.5 we get∥∥∥∥xi(t) ∥∥∥∥ ≤ ( γ1eγ1(b−a)(b − a) + 1 ) L + eγ1(b−a) ∫ [a,b)T k(s)�s := L1 for all t ∈ T. Then ∥∥∥∥x� i (t) ∥∥∥∥ ≤ jγ L1 + k(t) � − a.e. t ∈ [a, b)T. Now, using Proposition 2.4 we conclude the proof. � Theorem 3.4. Assume that (H1) − (H8) are satisfied for the optimal control problem (P). If the problem (P) has an admissible process, then there exists an optimal process (x, u) for (P). Proof. Let inf{P} denote the greatest lower bound on g(x(a), x(b)) over admissible processes (x, u) of (P). Thence there exists a sequence of admissible processes (xi , ui) of (P) obeying inf{P} = lim i→∞ g(xi (a), xi(b)). From Lemma 3.5 there exists a subsequence of {xi }, we do not relabel, such that {xi } converges uniformly for an arc x , that is, xi ⇒ x . Now we prove that there is a �-measurable selection u of U such that (x, u) is an admissible process for (P). Let t, s ∈ T be such that t ≤ s. We have lim i→∞ ∫ [t ,s)T f (τ, xi(τ ), ui (τ ))�τ = lim i→∞ ( xi (s) − xi (t) ) = x(s) − x(t) = ∫ [t ,s)T x�(τ)�τ Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 90 — #10 � � � � � � 90 EXISTENCE OF SOLUTIONS FOR OPTIMAL CONTROL PROBLEMS By (H5) we get ∥∥∥∥ f (τ, xi(τ ), ui (τ )) − f (τ, x(τ ), ui (τ )) ∥∥∥∥ ≤ K ∥∥∥∥xi(τ ) − x(τ ) ∥∥∥∥ � − a.e. τ ∈ [a, b)T and thus lim i→∞ ∥∥∥∥ f (τ, xi(τ ), ui (τ )) − f (τ, x(τ ), ui (τ )) ∥∥∥∥ = 0 � − a.e. τ ∈ [a, b)T. Note that ∫ [t ,s)T ( f (τ, x(τ ), ui (τ )) − x�(τ) ) �τ = ∫ [t ,s)T ( f (τ, x(τ ), ui (τ )) − f (τ, xi (τ ), ui (τ )) ) �τ + ∫ [t ,s)T ( f (τ, xi (τ ), ui (τ )) − x�(τ) ) �τ and that lim i→∞ ∫ [t ,s)T ( f (τ, x(τ ), ui (τ )) − f (τ, xi (τ ), ui (τ )) ) �τ = 0 because of the dominated convergence theorem ([9]). Using Proposition 2.4, we obtain lim i→∞ ∫ [t ,s)T ( x� i (τ ) − x�(τ) ) �τ = lim i→∞ ∫ [t ,s)T ( f (τ, xi(τ ), ui (τ )) − x�(τ) ) �τ = 0. Then lim i→∞ ∫ [t ,s)T ( f (τ, x(τ ), ui (τ )) − x�(τ) ) �τ = 0. (3.1) Let p ∈ Rn be arbitrarily fixed. Then by (3.1) we have lim i→∞〈p , ∫ [t ,s)T ( f (τ, x(τ ), ui (τ )) − x�(τ) ) �τ 〉 = 0. For any i we also have ∫ [t ,s)T max u∈U(t) 〈p , ( f (τ, x(τ ), u) − x�(τ) ) 〉�τ ≥ 〈p , ∫ [t ,s)T ( f (τ, x(τ ), ui (τ )) − x�(τ) ) �τ 〉 Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 91 — #11 � � � � � � SANTOS 91 and therefore ∫ [t ,s)T max u∈U(t) 〈p , ( f (τ, x(τ ), u) − x�(τ) ) 〉�τ ≥ 0. From Proposition 2.3 we deduce that max v∈ f (τ,x(τ ),U(τ )) 〈p , v〉 ≥ 〈p , x�(τ)〉 � − a.e. τ ∈ [a, b)T that is, H (τ, x(τ ), p) ≥ 〈p , x�(τ)〉 � − a.e. τ ∈ [a, b)T. As p is arbitrary, we can use standard procedures (e.g., [12], p. 91) which involves the separa- bility of Rn and the geometric Hahn-Banach separation theorem for convex sets, to obtain x�(t) ∈ { f (t, x(σ(t)), u) : u ∈ U (t)} � − a.e. t ∈ [a, b)T. Theorem 2.3 ensures the existence of a �-measurable selection u of U such that the process (x, u) satisfies (2.1). Since A × C is a closed set we deduce that (x(a), x(b)) ∈ A × C. Hence (x, u) is an admissible process for (P). Finally, since inf{P} = lim i→∞ g(xi(a), xi (b)) = lim inf i→∞ g(xi(a), xi (b)) ≥ g(x(a), x(b)) ≥ inf{P} we may conclude that (x, u) is an optimal process for (P). � RESUMO. Este artigo considera uma classe de problemas de controle ótimo em escalas temporais descritos por equações dinâmicas em escalas temporais. Para essa classe, os estados são absolutamente contı́nuos. Nós estabelecemos condições suficientes para a existência de controles ótimos. Palavras-chave: escalas temporais, sistemas de controle, controle ótimo. REFERENCES [1] M. Bohner & A. Peterson. “Dynamic Equations on Time Scales”, Birkhäuser Boston Inc., Boston, (2001). [2] A. Cabada & D.R. Vivero. Criterions for absolute continuity on time scales, J. Difference Equ. Appl., 11(11) (2005), 1013–1028. Tend. Mat. Apl. Comput., 17, N. 1 (2016) � � “main” — 2016/4/16 — 14:54 — page 92 — #12 � � � � � � 92 EXISTENCE OF SOLUTIONS FOR OPTIMAL CONTROL PROBLEMS [3] A. Cabada & D.R. Vivero. Expression of the Lebesgue �-integral on time scales as a usual Lebesgue integral: application to the calculus of �-antiderivatives, Math. Comput. Modelling, 43(1-2) (2006), 194–207. [4] A.F. Filippov. On certain questions in the theory of optimal control, J. SIAM Control Ser. A 1 (1962), 76–84. [5] G.S. Guseinov. Integration on time scales, J. Math. Anal. Appl., 285(1) (2003), 107–127. [6] R. Hilscher & V. Zeidan. Weak maximum principle and accessory problem for control problems on time scales, Nonlinear Anal. 70(9) (2009), 3209–3226. [7] Y. Peng, X. Xiang & Y. Jiang. Nonlinear dynamic systems and optimal control problems on time scales, ESAIM Control Optim. Calc. Var., 17(3) (2011), 654–681. [8] E. Roxin. The existence of optimal controls, Michigan Math. J., 9 (1962), 109–119. [9] W. Rudin. “Real and Complex Analysis”, third edition, McGraw-Hill Book Company, New York (1987). [10] I.L.D. Santos & G.N. Silva. Absolute continuity and existence of solutions to dynamic inclusions in time scales, Math. Ann., 356(1) (2013), 373–399. [11] I.L.D. Santos & G.N. Silva. Filippov’s selection theorem and the existence of solutions for optimal control problems in time scales, Comput. Appl. Math., 33(1) (2014), 223–241. [12] R.B. Vinter. “Optimal Control”, Systems and Control: Foundations and Applications, Birkhäuser, Boston (2000). [13] Z. Zhan, W. Wei, Y. Li & H. Xu. Existence for calculus of variations and optimal control problems on time scales, Int. J. Innov. Comput. Inf. Control, 8 (2012), 3793–3808. Tend. Mat. Apl. Comput., 17, N. 1 (2016)