Mostrar el registro sencillo del ítem

dc.contributor.authorCerisola Lopez De Haro, Santiagoes-ES
dc.contributor.authorLatorre Canteli, Jesús Maríaes-ES
dc.contributor.authorBaillo Moreno, Alvaroes-ES
dc.date.accessioned2016-10-18T12:05:14Z
dc.date.available2016-10-18T12:05:14Z
dc.identifier.urihttp://hdl.handle.net/11531/14171
dc.description.abstractes-ES
dc.description.abstractThe problem of scenario tree generation is closely related to that of stochastic programming. A natural approach in stochastic programming consists of replacing the continuous random parameters that represent uncertainty by discrete ones that approximate the continuous distribution in some optimal criteria. For multistage stochastic programming, this discrete distribution is usually required to have a tree-shape form, giving a discrete distribution that disclosures with the time realization. The construction of this type of distribution is known as scenario tree generation. Usually, the starting point is a collection of samples obtained from some alternative model or from real data. In this paper it is extended a clustering technique to obtain a family of clusters centers that share the scenario values up to the ramification node. The algorithm is employed to generate multivariate distribution functions that enter into a stochastic portfolio model.en-GB
dc.format.mimetypeapplication/pdfes_ES
dc.language.isoen-GBes_ES
dc.rightses_ES
dc.rights.uries_ES
dc.titleScenario tree generation through the neural gas algorithmes_ES
dc.typeinfo:eu-repo/semantics/workingPaperes_ES
dc.description.versioninfo:eu-repo/semantics/draftes_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccesses_ES
dc.keywordses-ES
dc.keywordsScenario tree, stochastic optimization, k-means algorithmen-GB


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem