5 resultados para 1.0-1.1 phi

em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco


Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Lan honen helburua La1-x Cax MnO3 [x ~ 0.2] (perovskiten familiakoa) laginaren azterketan oinarritzen da. "High resolution dielectric analyzer" tresnari esker permitibitate dielektrikoa neurtuko da eta honen bitartez erresistentzia eta eroankortasun elektrikoa. Azterketa hau [10-2, 107] Hz maiztasun-tarte batean eta tenperatura desberdinetan (150K, 170K, 190K, 210K, 230K, 300K) burutuko da, ondoren materialak magnitude hauen bariazioekiko duen erantzuna aztertuz.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this work we extend to the multistage case two recent risk averse measures for two-stage stochastic programs based on first- and second-order stochastic dominance constraints induced by mixed-integer linear recourse. Additionally, we consider Time Stochastic Dominance (TSD) along a given horizon. Given the dimensions of medium-sized problems augmented by the new variables and constraints required by those risk measures, it is unrealistic to solve the problem up to optimality by plain use of MIP solvers in a reasonable computing time, at least. Instead of it, decomposition algorithms of some type should be used. We present an extension of our Branch-and-Fix Coordination algorithm, so named BFC-TSD, where a special treatment is given to cross scenario group constraints that link variables from different scenario groups. A broad computational experience is presented by comparing the risk neutral approach and the tested risk averse strategies. The performance of the new version of the BFC algorithm versus the plain use of a state-of-the-artMIP solver is also reported.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

[EN] Combination of polycarboxylate anions and dipyridyl ligands is an effective strategy to produce solid coordination frameworks (SCF) which are crystalline materials based on connections between metal ions through organic ligands. In this sense, combination of polycarboxylate anions and dipyridyl ligands is an effective strategy to produce extended structures. In this context, this work is focused on two novel CuII-based SCFs exhibiting PDC (2,5-pyridinedicarboxylate) and bpa (1,2-di(4-pyridyl)ethane), being the first structures reported in literature containing both ligands. Chemical formula are [Cu2[(PDC)2(bpa)(H2O)2]•3H2O•DMF (1), and [Cu2(PDC)2(bpa)(H2O)2]•7H2O (2), where DMF is dimethylformamide. Compounds 1 and 2 have been characterized by means of XRD, IR, TG/DTG, and DTA analysis.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Comunicación (Poster) en panel del congreso: Designing New Heterogeneous Catalysts, Faraday Discussion, 4–6 April 2016. London, United Kingdom.