Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1649
DC FieldValueLanguage
dc.contributor.authorJović, Aleksandaren_US
dc.date.accessioned2025-03-13T20:15:19Z-
dc.date.available2025-03-13T20:15:19Z-
dc.date.issued2021-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1649-
dc.description.abstractIn this paper, vector continuous-time programming problems with inequality constraints are considered. The sufficient optimality conditions under generalized convexity assumption are established. The results were formulated using differentiability.en_US
dc.language.isoenen_US
dc.publisherBeograd : Matematički fakulteten_US
dc.subjectcontinious-time programmingen_US
dc.subjectvector problemsen_US
dc.subjectoptimality conditionsen_US
dc.subjectproperly efficient solutionsen_US
dc.titleSufficiency Criteria in Continious-Time Programming Problems of Vectoren_US
dc.typeConference Objecten_US
dc.relation.conferenceSimpozijum o operacionim istraživanjima SYM-OP-IS(48 ; 2021 ; Banja Koviljača)en_US
dc.relation.publicationZbornik radova - XLVIII Simpozijum o operacionim istraživanjima = XLVIII International Symposium on Operational Research, SYM-OP-IS 2021en_US
dc.identifier.urlhttp://symopis2021.matf.bg.ac.rs/download/Zbornik-SYM-OP-IS2021.pdf-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.isbn978-86-7589-151-2en_US
dc.description.rankM33en_US
dc.relation.firstpage393en_US
dc.relation.lastpage397en_US
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeConference Object-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0003-0414-7969-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.