2 resultados para Branch-and-bound algorithm
em Universidad de Alicante
Resumo:
This research study deals with the quantification and characterization of the EPS obtained from two 25 L bench scale membrane bioreactors (MBRs) with micro-(MF-MBR) and ultrafiltration (UF-MBR) submerged membranes. Both reactors were fed with synthetic water and operated for 168 days without sludge extraction, increasing their mixed liquor suspended solid (MLSS) concentration during the experimentation time. The characterization of soluble EPS (EPSs) was achieved by the centrifugation of mixed liquor and bound EPS (EPSb) by extraction using a cationic resin exchange (CER). EPS characterization was carried out by applying the 3-dimensional excitation–emission matrix fluorescence spectroscopy (3D-EEM) and high-performance size exclusion chromatography (HPSEC) with the aim of obtaining structural and functional information thereof. With regard to the 3D-EEM analysis, fluorescence spectra of EPSb and EPSs showed 2 peaks in both MBRs at all the MLSS concentrations studied. The peaks obtained for EPSb were associated to soluble microbial by-product-like (predominantly protein-derived compounds) and to aromatic protein. For EPSs, the peaks were associated with humic and fulvic acids. In both MBRs, the fluorescence intensity (FI) of the peaks increased as MLSS and protein concentrations increased. The FI of the EPSs peaks was much lower than for EPSb. It was verified that the evolution of the FI clearly depends on the concentration of protein and humic acids for EPSb and EPSs, respectively. Chromatographic analysis showed that the intensity of the EPSb peak increased while the concentrations of MLSS did. Additionally, the mean MW calculated was always higher the higher the MLSS concentrations in the reactors. MW was higher for the MF-MBR than for the UF-MBR for the same MLSS concentrations demonstrating that the filtration carried out with a UF membrane lead to retentions of lower MW particles.
Resumo:
The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.