1. RFOS
  2. Fakultet organizacionih nauka
  3. Radovi istraživača / Researchers’ publications
Please use this identifier to cite or link to this item: https://rfos.fon.bg.ac.rs/handle/123456789/792
Full metadata record
DC FieldValueLanguage
dc.creatorMarinovic, Minja
dc.creatorStanojević, Milan
dc.creatorMakajić-Nikolić, Dragana
dc.date.accessioned2023-05-12T10:23:08Z-
dc.date.available2023-05-12T10:23:08Z-
dc.date.issued2011
dc.identifier.urihttps://rfos.fon.bg.ac.rs/handle/123456789/792-
dc.description.abstractIn this paper, the problem of day-ahead planning in the trading section of energy trading companies has been considered. It has been assumed that the demand and supply are arranged and that the additional MW and transmission capacity can be purchased. The problem is observed as directed multiple-source and multiple-sink network and then represented by LP mathematical model of total daily profit maximization subject to flow constraints. A numerical example is presented to illustrate the application of the model.en
dc.publisherSlovenian Society Informatika
dc.relationinfo:eu-repo/grantAgreement/MESTD/Technological Development (TD or TR)/32013/RS//
dc.relationinfo:eu-repo/grantAgreement/MESTD/Technological Development (TD or TR)/35045/RS//
dc.rightsrestrictedAccess
dc.sourceProceedings of the 11th International Symposium on Operational Research in Slovenia, SOR 2011
dc.subjectnetwork flowen
dc.subjectLP modelen
dc.subjectenergy tradingen
dc.subjectday-ahead planningen
dc.titleLP model for day-ahead planning in energy tradingen
dc.typeconferenceObject
dc.rights.licenseARR
dc.citation.epage80
dc.citation.other: 75-80
dc.citation.spage75
dc.identifier.rcubconv_3348
dc.identifier.scopus2-s2.0-84903650294
dc.identifier.wos000393632800013
dc.type.versionpublishedVersion
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairetypeconferenceObject-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Radovi istraživača / Researchers’ publications
Show simple item record

SCOPUSTM   
Citations

1
checked on Nov 17, 2025

Google ScholarTM

Check


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