Showing 1 - 10 of 12,483
will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As …
Persistent link: https://www.econbiz.de/10010421344
-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …
Persistent link: https://www.econbiz.de/10010325798
theoretical as well as the quantitative analysis, recommendations are derived for a better allocation of the reduction burden …
Persistent link: https://www.econbiz.de/10010273116
A necessary condition - the Principle of Fermat-Lagrange - is offered for mixed smooth-convexoptimization problems. This generalizes and unifies most of the known necessary conditions forconcrete finite and infinite dimensional optimization problems of interest. The new idea in comparisonwith...
Persistent link: https://www.econbiz.de/10010324495
In this paper we introduce several classes of generalized convexfunctions already discussed in the literature and show the relationbetween those function classes. Moreover, for some of those functionclasses a Farkas-type theorem is proved. As such this paper unifiesand extends results existing...
Persistent link: https://www.econbiz.de/10010324692
. Therefore a combinatorial optimisation algorithm is developed and an algorithm based on graph search is used and customised … correctness of the quick combinatorial algorithm are proved within this paper. For vehicle to grid (V2G) concepts, battery … been used to include degradation costs for different Li-Ion batteries into the graph search algorithm. An application of …
Persistent link: https://www.econbiz.de/10010300726
prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10010325776
Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based … random walk Metropolis-Hastings algorithm is obtained for a special case and it is shown to decrease in the number of …
Persistent link: https://www.econbiz.de/10010281448
, (2) sales force location, (3) sales territory alignment, and (4) sales effort allocation are the subjects of …
Persistent link: https://www.econbiz.de/10011558753
replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given … finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm … is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006). …
Persistent link: https://www.econbiz.de/10010281178