
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
  <dc:title xml:lang="srp">Услови оптималности за изопериметријске проблеме оптимизације са непрекидним временом : докторска дисертација</dc:title>
  <dc:creator id="https://plus.cobiss.net/cobiss/sr/sr/conor/134813449">Vicanović, Jelena, 1987-</dc:creator>
  <dc:contributor id="https://plus.cobiss.net/cobiss/sr/sr/conor/24133991">Marinković, Boban, 1970-</dc:contributor>
  <dc:contributor id="https://plus.cobiss.net/cobiss/sr/sr/conor/12748135">Savić, Aleksandar, 1967-</dc:contributor>
  <dc:contributor id="https://plus.cobiss.net/cobiss/sr/sr/conor/88892681">Jović, Aleksandar, 1970-</dc:contributor>
  <dc:contributor id="https://plus.cobiss.net/cobiss/sr/sr/conor/57293065">Gajić, Borislav</dc:contributor>
  <dc:description xml:lang="srp">Формулисан је конвексан проблем максимизације са непрекидним временом и дати су неопходни услови оптималности у бесконачно димензионом случају...</dc:description>
  <dc:description xml:lang="eng">A convex continuous-time maximization problem is formulated and the necessaryoptimality conditions in the infinite-dimensional case are obtained. As a main tool forobtaining optimal conditions in this dissertation we use the new theorem of the alternative.Since there’s no a differentiability assumption, we perform a linearization of the problemusing subdifferentials. It is proved that the multiplier with the objective function won’t beequal to zero. It was also shown that if the linear and non-linear constraints are separated,with additional assumptions it can be guaranteed that the multiplier with non-linear constraintswill also be non-zero. In the following, an integral constraint is added to the original convexproblem, so that a Lyapunov-type problem, i.e. an isoperimetric problem, is considered. Linearizationof the problem using subdifferentials proved to be a practical way to ignore the lackof differentiability, so the optimality conditions were derived in a similar way. It is shown thatthe obtained results will also be valid for the vector case of the isoperimetric problem.Additionally, the optimality conditions for the smooth problem were considered. On theminimization problem, it was shown that the necessary conditions of Karush-Kuhn-Tucker typewill be valid with the additional regularity constraint condition. Also, any point that satisfiesthe mentioned optimality conditions will be a global minimum.</dc:description>
  <dc:description xml:lang="srp">Математика-Оптимизација / Mathematics -Оptimization  
Datum odbrane: 18.06.2024. </dc:description>
  <dc:date>2024</dc:date>
  <dc:format>62 стр.</dc:format>
  <dc:format>2220263 bytes</dc:format>
  <dc:subject xml:lang="srp">OSNO - Opšta sistematizacija naučnih oblasti, Operaciono istraživanje</dc:subject>
  <dc:subject xml:lang="eng">OSNO - Opšta sistematizacija naučnih oblasti, Operaciono istraživanje</dc:subject>
  <dc:subject xml:lang="eng">OSNO - Opšta sistematizacija naučnih oblasti, Računarsko programiranje. Aplikativni programi</dc:subject>
  <dc:subject xml:lang="srp">OSNO - Opšta sistematizacija naučnih oblasti, Računarsko programiranje. Aplikativni programi</dc:subject>
  <dc:subject xml:lang="srp">Проблеми оптимизације са непрекидним временом, Конвексно програмирање, Услови оптималности, Теореме алтернативе, Изопериметријски проблеми, Вишекритеријумски проблеми оптимизације са непрекидним временом</dc:subject>
  <dc:subject xml:lang="eng">Continuous-time programming, Convex programming, Optimality conditions, Theorems of the alternative, Isoperimetric problems, Multiobjective continuous-time programming problems</dc:subject>
  <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/at/legalcode</dc:rights>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:38120</dc:identifier>
  <dc:identifier>cobiss:188752905</dc:identifier>
  <dc:identifier>thesis:10112</dc:identifier>
  <dc:language>srp</dc:language>
  <dc:type>info:eu-repo/semantics/bachelorThesis</dc:type>
</oai_dc:dc>
