A carregar...
A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: II. Probabilistic Guarantees on Constraint Satisfaction
Probabilistic guarantees on constraint satisfaction for robust counterpart optimization are studied in this paper. The robust counterpart optimization formulations studied are derived from box, ellipsoidal, polyhedral, “interval+ellipsoidal” and “interval+polyhedral” uncertainty sets (Li, Z., Ding,...
Na minha lista:
| Main Authors: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2012
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3544168/ https://ncbi.nlm.nih.gov/pubmed/23329868 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1021/ie201651s |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|