The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper, we describe a decomposition algorithm suitable for two-stage convex stochastic programs known as Generalized Benders Decomposition. For this algorithm we propose a new reformulation that incorporates a lower bound cut that serves as a warm-start, decreasing the overall computation time. Additionally, we test the performance of the proposed reformulation on two modifications of the algorithm (bunching and multicut) using numerical examples. The numerical part is programmed in MATLAB...
In proteomics study, Imaging Mass Spectrometry (IMS) is an emerging and very promising
new technique for protein analysis from intact biological tissues. Though it has shown
great potential and is very promising for rapid mapping of protein localization and the
detection of sizeable differences in protein expression, challenges remain in data
processing due to the difficulty of high dimensionality and the fact that the number of
input variables in...
We present some properties of mixture and generalized mixture operators, with special stress on their monotonicity. We introduce new sufficient conditions for weighting functions to ensure the monotonicity of the corresponding operators. However, mixture operators, generalized mixture operators neither quasi-arithmetic means weighted by a weighting function need not be non- decreasing operators, in general.
Relations between (proper) Pareto optimality of solutions of multicriteria optimization problems and solutions of the minimization problems obtained by replacing the multiple criteria with -norm related functions (depending on the criteria, goals, and scaling factors) are investigated.
Currently displaying 1 –
10 of
10