This article investigates the properness, or well-posedness, of impulsive extension of a conventional optimal control problem. This includes both well-posedness of the solution to impulsive control systems arising as result of an impulsive extension of ordinary differential systems, and existence theorems. Well-posedness in the classic Cauchy sense is proved. Approximation lemmas that guarantee sensitivity to small perturbations in control variables are obtained. Filippov type existence theorems are established. A model example is provided to show the relevance of the impulsive controls problems which are under study.

No abstract

We introduce the class of MP-pseudoinvex multiobjective optimal control problems. We show that the concept of MP-pseudoinvexity is a sufficient condition of optimality and, further, that problems such that every control process satisfying Pontryagin's maximum principle is an optimal process are necessarily MP-pseudoinvex problems. Moreover, a sub-class of the MP-pseudoinvex problems, which we call MPinvex multiobjective optimal control problems, is defined. We prove that the set of optimal solutions of MP-invex multiobjective problems coincides with the set of optimal solutions of a related scalar problem.

Some problems of Calculus of Variations do not have solutions in the class of classic continuous and smooth arcs. This suggests the need of a relaxation or extension of the problem ensuring the existence of a solution in some enlarged class of arcs. This work aims at the development of an extension for a more general optimal control problem with nonlinear control dynamics in which the control function takes values in some closed, but not necessarily bounded, set. To achieve this goal, we exploit the approach of R.V. Gamkrelidze based on the generalized controls, but related to discontinuous arcs. This leads to the notion of generalized impulsive control. The proposed extension links various approaches on the issue of extension found in the literature.

We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvexity is a necessary and suffcient condition for a vector Karush-Kuhn-Tucker solution to be a weakly efficient solution.