نتایج جستجو برای: upper bound pressure

تعداد نتایج: 756086  

Journal: :iranian journal of fuzzy systems 2014
r. sathy p. balasubramaniam r. chandran

in this paper, we investigate the delay-dependent robust stability of fuzzy cohen-grossberg neural networks with markovian jumping parameter and mixed time varying delays by delay decomposition method. a new lyapunov-krasovskii functional (lkf) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...

M. Hajialilou Bonab, P. Hamidi, T. Akhlaghi,

Calculation of lateral earth pressure on retaining walls is one of the main issues in geotechnics. The upper and lower bound theorems of plasticity are used to analyze the stability of geotechnical structures include bearing capacity of foundations, lateral earth pressure on retaining walls and factor of safety of slopes. In this paper formulation of finite element limit analysis is introduced ...

Ring rolling is one of the most significant methods for producing rings with highly precise dimensions and superior qualities such as high strength uniformity, all accomplished without wasting any materials. In this article, we have achieved analytical formulas for calculating the pressure and shear friction over the contact arcs between the rollers and ring in the ring rolling process for the ...

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

M. ‎Rostamy-‎Malkhalifeh‎‎, Z. ‎Aghababazadeh‎‎

It is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎Also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

Several methods have been proposed for ranking the decision-making units (DMUs) in data envelopment analysis (DEA) with imprecise data. Some methods have only used the upper bound efficiencies to rank DMUs. However, some other methods have considered both of the lower and upper bound efficiencies to rank DMUs. The current paper shows that these methods did not consider the DEA axioms and may be...

Habibe Sadeghi Leila Karimi

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید