Displaying similar documents to “Dynamic approach to optimum synthesis of a four-bar mechanism using a swarm intelligence algorithm”

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge, Minghao Chen, Hiroaki Ishii (2012)

Kybernetika

Similarity:

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...

A new regular multiplier embedding

Gemayqzel Bouza Allende, Jürgen Guddat (2013)

Kybernetika

Similarity:

Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions...

The sum-product algorithm: algebraic independence and computational aspects

Francesco M. Malvestuto (2013)

Kybernetika

Similarity:

The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of...