Optimality Conditions for Isoperimetric Continuous-Time Optimization Problems
DOI:
https://doi.org/10.2298/YJOR220415013VKeywords:
Continuous-Time Programming, Convex Programming, Isoperimetric Problems, Necessary Optimality Conditions, Theorems of the Alternative.Abstract
In this paper we deal with a nonsmooth case of isoperimetric convex continuoustime programming problem with inequality integral constraint and phase constraint, defined in L∞([0, T],Rn). In order to obtain necessary optimality conditions for this problem, we will use a theorem of the alternative from [15] as a main tool.References
V.M. Alekseev, V.M. Tikhomirov, and S.V. Fomin, Optimal control, New York: Plenum Publishing Corporation, 1987.
R. Bellman, “Bottleneck problems and dynamic programming,” Proceedings of the National Academy of Sciences of the United States of America, vol. 39, pp. 947-951, 1953.
C.H. Scott, and T.R. Jefferson, “Duality in infinite-dimensional mathematical programming: Convex integral functionals,” Journal of Mathematical Analysis and Applications, vol. 61, pp. 251-261, 1977.
J. Abraham, and R.N. Buie, “Kuhn-Tucker conditions and duality in continuous programming,” Utilitas Mathematica, vol. 16, pp. 15-37, 1979.
T.W. Reiland, and M.A. Hanson, “Generalised Kuhn-Tucker conditions and duality for continuous-time nonlinear programming problems,” Journal of Mathematical Analysis and Applications, vol. 74, pp. 578-598, 1980.
M.R.C. do Monte, and V.A. de Oliveira, “Necessary conditions for continuous-time optimization under the Mangasarian-Fromovitz constraint qualification,” Optimization, vol. 69, pp. 777-798, 2020.
G.J. Zalmai, “A continuous time generalization of Gordan’s Transposition Theorem,” Journal of Mathematical Analysis and Applications, vol. 110, pp. 130-140, 1985.
G.J. Zalmai, “The Fritz-John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming,” Journal of Mathematical Analysis and Applications, vol. 110, pp. 503-518, 1985.
G.J. Zalmai, “Optimality conditions and Lagrangian duality in continuous-time nonlinear programming,” Journal of Mathematical Analysis and Applications, vol. 109, pp. 426-452, 1985.
G.J. Zalmai, “Sufficient optimality conditions in continuous-time nonlinear programming,” Journal of Mathematical Analysis and Applications, vol. 111, pp. 130-147, 1985.
M.A. Hanson, and B. Mond, “A class of continuous convex programming problems,” Journal of Mathematical Analysis and Applications, vol. 22, pp. 427-437, 1968.
T.W. Reiland, “Optimality conditions and duality in continuous programming I. Convex programs and a theorem of the alternative,” Journal of Optimization Theory and Applications, vol. 77, pp. 297-325, 1980.
A.J.V. Brandão, M.A. Rojas-Medar, and G.N. Silva, “Nonsmooth continuous-time optimization problems: necessary conditions,” Computers Mathematics with Applications, vol. 41, pp. 1477-1486, 2001.
J.V. Outrata, and W. R¨omisch, “On optimality conditions for some nonsmooth optimization problems over Lp spaces,” Journal of Optimization Theory and Applications, vol. 126, pp. 411-438, 2005.
A.V. Arutyunov, S.E. Zhukovskiy, and B. Marinkovi´c, “Theorems of the Alternative for Systems of Convex Inequalities,” Set-Valued and Variational Analysis, vol. 27, pp. 51-70, 2019.
O.L. Mangasarian, Nonlinear programming, New York: McGraw-Hill, 1969.
V.A. de Oliveira, and M.A. Rojas-Medar, “Continuous-time optimization problems involving invex functions,” Journal of Mathematical Analysis and Applications, vol. 327, pp. 1320- 1334, 2007.
A.V. Arutyunov, and S.E. Zhukovskiy, “On estimates for solutions of systems of convex inequalities,” Computational Mathematics and Mathematical Physics, vol. 55, pp. 1444-1450, 2015.
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
