el uso de un problema de complementariedad lineal extendido para la obtención de sucesiones temporales optimas

Clicks: 201
ID: 252785
2005
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #27 of 46 articles by views in acque sotterranee

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
En este trabajo mostramos como mediante el un problema de complementariedad lineal extendida, que es un problema de programación matemática podemos obtener una sucesión temporal switching óptima. Primeramente analizamos el problema de complementariedad lineal (LCP) y definimos una extensión de este al denominado problema de complementariedad lineal extendida (XLCP). A continuación estudiamos el caso de las sucesiones temporales óptimas y consideramos el problema de obtener un instante (temporal) óptimo switching. Finalmente estudiamos como a partir del problema de complementariedad lineal extendida podemos obtener una sucesión temporal switching óptima que nos permite calcular ese valor óptimo de tiempo.
Reference Key
mguez2005rect@el Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Fernando Rey Míguez;Luis P. Pedreira Andrade
Journal acque sotterranee
Year 2005
DOI
DOI not found
URL
http://urls.my/dlnNmy
Keywords
probabilities optimización mathematical statisticssocial sciences sucesiones temporales

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.