75 research outputs found
Optimising the management of vaginal discharge syndrome in Bulgaria: cost effectiveness of four clinical algorithms with risk assessment
OBJECTIVES: To evaluate the performance and cost effectiveness of the WHO recommendations of incorporating risk-assessment scores and population prevalence of Neisseria gonorrhoeae (NG) and Chlamydia trachomatis (CT) into vaginal discharge syndrome (VDS) algorithms. METHODS: Non-pregnant women presenting with VDS were recruited at a non-governmental sexual health clinic in Sofia, Bulgaria. NG and CT were diagnosed by PCR and vaginal infections by microscopy. Risk factors for NG/CT were identified in multivariable analysis. Four algorithms based on different combinations of behavioural factors, clinical findings and vaginal microscopy were developed. Performance of each algorithm was evaluated for detecting vaginal and cervical infections separately. Cost effectiveness was based on cost per patient treated and cost per case correctly treated. Sensitivity analysis explored the influence of NG/CT prevalence on cost effectiveness. RESULTS: 60% (252/420) of women had genital infections, with 9.5% (40/423) having NG/CT. Factors associated with NG/CT included new and multiple sexual partners in the past 3 months, symptomatic partner, childlessness and >or=10 polymorphonuclear cells per field on vaginal microscopy. For NG/CT detection, the algorithm that relied solely on behavioural risk factors was less sensitive but more specific than those that included speculum examination or microscopy but had higher correct-treatment rate and lower over-treatment rates. The cost per true case treated using a combination of risk factors, speculum examination and microscopy was euro 24.08. A halving and tripling of NG/CT prevalence would have approximately the inverse impact on the cost-effectiveness estimates. CONCLUSIONS: Management of NG/CT in Bulgaria was improved by the use of a syndromic approach that included risk scores. Approaches that did not rely on microscopy lost sensitivity but were more cost effective
Stochastic Programming with Multivariate Second Order Stochastic Dominance Constraints with Applications in Portfolio Optimization
Processing second-order stochastic dominance models using cutting-plane representations
This is the post-print version of the Article. The official published version can be accessed from the links below. Copyright @ 2011 Springer-VerlagSecond-order stochastic dominance (SSD) is widely recognised as an important decision criterion in portfolio selection. Unfortunately, stochastic dominance models are known to be very demanding from a computational point of view. In this paper we consider two classes of models which use SSD as a choice criterion. The first, proposed by Dentcheva and Ruszczyński (J Bank Finance 30:433–451, 2006), uses a SSD constraint, which can be expressed as integrated chance constraints (ICCs). The second, proposed by Roman et al. (Math Program, Ser B 108:541–569, 2006) uses SSD through a multi-objective formulation with CVaR objectives. Cutting plane representations and algorithms were proposed by Klein Haneveld and Van der Vlerk (Comput Manage Sci 3:245–269, 2006) for ICCs, and by Künzi-Bay and Mayer (Comput Manage Sci 3:3–27, 2006) for CVaR minimization. These concepts are taken into consideration to propose representations and solution methods for the above class of SSD based models. We describe a cutting plane based solution algorithm and outline implementation details. A computational study is presented, which demonstrates the effectiveness and the scale-up properties of the solution algorithm, as applied to the SSD model of Roman et al. (Math Program, Ser B 108:541–569, 2006).This study was funded by OTKA, Hungarian
National Fund for Scientific Research, project 47340; by Mobile Innovation Centre, Budapest University of Technology, project 2.2; Optirisk Systems, Uxbridge, UK and by BRIEF (Brunel University Research Innovation and Enterprise Fund)
Large-scale unit commitment under uncertainty: an updated literature survey
The Unit Commitment problem in energy management aims at finding the optimal production schedule of a set of generation units, while meeting various system-wide constraints. It has always been a large-scale, non-convex, difficult problem, especially in view of the fact that, due to operational requirements, it has to be solved in an unreasonably small time for its size. Recently, growing renewable energy shares have strongly increased the level of uncertainty in the system, making the (ideal) Unit Commitment model a large-scale, non-convex and uncertain (stochastic, robust, chance-constrained) program. We provide a survey of the literature on methods for the Uncertain Unit Commitment problem, in all its variants. We start with a review of the main contributions on solution methods for the deterministic versions of the problem, focussing on those based on mathematical programming techniques that are more relevant for the uncertain versions of the problem. We then present and categorize the approaches to the latter, while providing entry points to the relevant literature on optimization under uncertainty. This is an updated version of the paper "Large-scale Unit Commitment under uncertainty: a literature survey" that appeared in 4OR 13(2), 115--171 (2015); this version has over 170 more citations, most of which appeared in the last three years, proving how fast the literature on uncertain Unit Commitment evolves, and therefore the interest in this subject
- …